The following pages link to (Q5645210):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- A computational comparison of Gomory and knapsack cuts (Q580177) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- Total dual integrality and integer polyhedra (Q598999) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- Random half-integral polytopes (Q635514) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Cut generation through binarization (Q896284) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- A note on the MIR closure (Q924876) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- An advanced start algorithm for all-integer programming (Q1086158) (← links)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- The mixed cutting plane algorithm for all-integer programming (Q1092815) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- An upper bound on the number of cuts needed in Gomory's method of integer forms (Q1168218) (← links)
- Hamiltonian location problems (Q1173005) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- An extension of Hu's group minimization algorithm (Q1254946) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
- Robust decision making using a general utility set (Q1750483) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- One modification of Gomory's algorithm (Q1759135) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
