CONFORTI, MICHELANGELO

CONFORTI, MICHELANGELO  

Mostra records
Risultati 1 - 20 di 88 (tempo di esecuzione: 0.037 secondi).
Titolo Data di pubblicazione Autori Rivista Serie Titolo libro
A branch-and-cut algorithm for the equicut problem 1997 CONFORTI, MICHELANGELO + MATHEMATICAL PROGRAMMING - -
A characterization of matroidal systems of inequalities 1988 CONFORTI, MICHELANGELO + DISCRETE MATHEMATICS - -
A class of logic problems solvable by linear programming 1995 CONFORTI, MICHELANGELO + JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY - -
A construction for binary matroids 1987 CONFORTI, MICHELANGELO + DISCRETE MATHEMATICS - -
A counterexample to a conjecture of Gomory and Johnson 2012 CONFORTI, MICHELANGELOZAMBELLI, GIACOMO + MATHEMATICAL PROGRAMMING - -
A geometric approach to cut-generating functions 2015 CONFORTI, MICHELANGELODI SUMMA, MARCO + MATHEMATICAL PROGRAMMING - -
A Geometric Perspective on Lifting 2011 CONFORTI, MICHELANGELOZAMBELLI, GIACOMO + OPERATIONS RESEARCH - -
A polyhedral approach to an integer multicommodity flow problem 2000 CONFORTI, MICHELANGELOFischetti, M. + DISCRETE APPLIED MATHEMATICS - -
A theorem of Truemper 2000 CONFORTI, MICHELANGELO + COMBINATORICA - -
An extreme function which is nonnegative and discontinuous everywhere 2020 Basu, AmitabhConforti, MichelangeloDi Summa, Marco MATHEMATICAL PROGRAMMING - -
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets 1992 CONFORTI, MICHELANGELO + DISCRETE MATHEMATICS - -
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations 1992 CONFORTI, MICHELANGELO + DISCRETE MATHEMATICS - -
Balanced 0, ± 1 Matrices I. Decomposition 2001 CONFORTI, MICHELANGELO + JOURNAL OF COMBINATORIAL THEORY - -
Balanced 0, ± 1 Matrices II. Recognition Algorithm 2001 CONFORTI, MICHELANGELO + JOURNAL OF COMBINATORIAL THEORY - -
Balanced 0, ±1-matrices, bicoloring and total dual integrality 1995 CONFORTI, MICHELANGELO + MATHEMATICAL PROGRAMMING - -
Balanced cycles and holes in bipartite graphs 1999 CONFORTI, MICHELANGELO + DISCRETE MATHEMATICS - -
Balanced matrices 2006 CONFORTI, MICHELANGELO + DISCRETE MATHEMATICS - -
Balas formulation for the union of polytopes is optimal 2020 Conforti, MichelangeloDi Summa, MarcoFAENZA, YURI MATHEMATICAL PROGRAMMING - -
Compact formulations as a union of polyhedra 2008 CONFORTI, MICHELANGELO + MATHEMATICAL PROGRAMMING - -
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II 2022 Basu A.Conforti M.Di Summa M. + COMBINATORICA - -