scientific article; zbMATH DE number 3373541

Cited in

(only showing first 100 items - show all)

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

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)