scientific article; zbMATH DE number 3373541

Cited in

(only showing first 100 items - show all)

Chvatal--Gomory--tier cuts for general integer programs
Implementation of Makanin's Algorithm
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Coordinated cutting plane generation via multi-objective separation
A primal-like algorithm for zero-one integer Fractional Programming Problem
An advanced start algorithm for all-integer programming
On the complete set packing and set partitioning polytopes: properties and rank 1 facets
Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
On the facets of mixed integer programs with two integer variables and two constraints
Rank of random half-integral polytopes. Extended abstract
The value function of an integer program
Branch and bound, integer, and non-integer programming
A primal dual integer programming algorithm
On the membership problem for the \({0, 1/2}\)-closure
On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
Robust decision making using a general utility set
Computational experience with a group theoretic integer programming algorithm
Revival of the Gomory cuts in the 1990's
Using cutting planes to solve the symmetric Travelling Salesman problem
An extension of Hu's group minimization algorithm
Total dual integrality and integer polyhedra
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
Scatter search and star-paths: Beyond the genetic metaphor
An optimality cut for mixed integer linear programs
A note on the MIR closure
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
Valid inequalities for mixed integer linear programs
Polyhedra of regular p-nary group problems
Outer-product-free sets for polynomial optimization and oracle-based cuts
Optimal cutting planes from the group relaxations
An abstract model for branch and cut
Cutting-plane proofs in polynomial space
Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
A computational comparison of Gomory and knapsack cuts
The traveling salesman problem: An overview of exact and approximate algorithms
Lexicography and degeneracy: Can a pure cutting plane algorithm work?
Integer solutions via goal programming to hierarchical systems.
Integer programming duality: Price functions and sensitivity analysis
One modification of Gomory's algorithm
Enumerative inequalities in integer programming
The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
Constructive characterizations of the value-function of a mixed-integer program. I
Solving 0-1 programming problems by a penalty approach.
Some contributions of Ailsa H. Land to the study of the traveling salesman problem
Starting-time decisions in labor tour scheduling: An experimental analysis and case study
On the complexity of cutting-plane proofs
How tight is the corner relaxation? Insights gained from the stable set problem
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
Feasibility jump: an LP-free Lagrangian MIP heuristic
On the enumerative nature of Gomory's dual cutting plane method
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
Cutting planes in combinatorics
Characterization of the split closure via geometric lifting
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
Optimizing over the first Chvátal closure
Binary extended formulations of polyhedral mixed-integer sets
Constructing the value function for an integer linear programme over a cone
MIPping closures: An instant survey
A branch and bound algorithm for the capacitated vehicle routing problem
Elementary closures for integer programs.
On the relative strength of split, triangle and quadrilateral cuts
Several notes on the power of Gomory-Chvátal cuts
On algorithms for discrete problems
Understanding cutting planes for QBFs
Improved strategies for branching on general disjunctions
A new lift-and-project operator
Cut generation through binarization
Cutting-plane theory: Algebraic methods
Matchings and covers in hypergraphs
Lattice reformulation cuts
Some polyhedra related to combinatorial problems
Gomory cuts revisited
Solving word equations
Facet generating techniques
An abstract model for branch-and-cut
On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
An upper bound on the number of cuts needed in Gomory's method of integer forms
A geometric approach to cut-generating functions
SCIP: solving constraint integer programs
Cutting planes width and the complexity of graph isomorphism refutations
Random half-integral polytopes
Airline crew scheduling: state-of-the-art
Chvátal closures for mixed integer programming problems
Hamiltonian location problems
Relaxations of mixed integer sets from lattice-free polyhedra
The mixed cutting plane algorithm for all-integer programming
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Cutting planes in integer and mixed integer programming
On convergence in mixed integer programming
A surrogate cutting plane algorithm for all-integer programming
Branch and cut methods for network optimization
A recursive procedure to generate all cuts for 0-1 mixed integer programs
Non delayed relax-and-cut algorithms
Transformation of integer programs to knapsack problems
Two-halfspace closure
Projected Chvátal-Gomory cuts for mixed integer linear programs
Narrow proofs may be maximally long
Sensitivity theorems in integer linear programming
Dual row modules and polyhedra of blocking group problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5645210)