Outline of an algorithm for integer solutions to linear programs

Cites work

On the Solution of Discrete Programming Problems

Cited in

(only showing first 100 items - show all)

A geometric characterization of ``optimality-equivalent relaxations
On the Chvátal rank of the pigeonhole principle
Solving the prize-collecting rural postman problem
Hybridizing exact methods and metaheuristics: a taxonomy
Stable sets, corner polyhedra and the Chvàtal closure
A finitely converging cutting plane technique
Cutting planes in combinatorics
Polyhedral proof methods in combinatorial optimization
Solution approaches for highly primal- and dual-degenerate all-integer programming problems
An advanced start algorithm for all-integer programming
A simple strategy for solving a class of 0-1 integer programming models
The mixed cutting plane algorithm for all-integer programming
A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
On cutting-plane proofs in combinatorial optimization
Submodularity and the traveling salesman problem
Comments on practical implementation of Gomory's fractional algorithm
Parametric integer linear programming: A synthesis of branch and bound with cutting planes
On surrogating 0-1 knapsack constraints
A primal dual integer programming algorithm
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
Solving \(0/1\) integer programs with enumeration cutting planes
Rational and integral \(k\)-regular matrices.
Optimal project selection when borrowing and lending rates differ
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
A new procedure for solving integer linear programming problems
Theoretical challenges towards cutting-plane selection
Extended formulation for hop constrained distribution network configuration problems
Integral simplex using decomposition with primal cutting planes
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
On the mixed set covering, packing and partitioning polytope
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
On semantic cutting planes with very small coefficients
An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Efficient reformulation for 0-1 programs -- methods and computational results
\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
The application of valid inequalities to the multi-stage lot-sizing problem
A simple finite cutting plane algorithm for integer programs
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Polyhedral approximations of the semidefinite cone and their application
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
Strengthened clique-family inequalities for the stable set polytope
Computing in combinatorial optimization
The aggregation closure is polyhedral for packing and covering integer programs
On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
On a generalization of the Chvátal-Gomory closure
On dedicated CDCL strategies for PB solvers
Computing equilibria for integer programming games
Discrete dynamical system approaches for Boolean polynomial optimization
A simple method for convex optimization in the oracle model
An abstract model for branch-and-cut
Systems theory and evidence-based decision-making as keys for arbitrating between optimal production and efficient maintenance: a case study
Outer-product-free sets for polynomial optimization and oracle-based cuts
Generating valid linear inequalities for nonlinear programs via sums of squares
On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
Ising formulations of some graph-theoretic problems in psychological research: models and methods
Design and verify: a new scheme for generating cutting-planes
On the Chvátal-Gomory closure of a compact convex set
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
Tactical optimization of the oil palm agribusiness supply chain
Improving set partitioning problem solutions by zooming around an improving direction
A geometric approach to cut-generating functions
Cutting to the chase.
Redundant robust topology optimization of truss
MIPping closures: An instant survey
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
Convex analysis in groups and semigroups: a sampler
When the Gomory-chvátal closure coincides with the integer hull
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Solving 0-1 programming problems by a penalty approach.
Projected Chvátal-Gomory cuts for mixed integer linear programs
A constraint generation algorithm for large scale linear programs using multiple-points separation
Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
Theory of majority decision elements
A duality theorem and an algorithm for (mixed-) integer nonlinear programming
An outline of linear programming
Gomory cuts revisited
The allocation of shared fixed costs
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
Chvátal-Gomory cuts for the Steiner tree problem
On the tree augmentation problem
Lifting the knapsack cover inequalities for the knapsack polytope
Integer feasibility and refutations in UTVPI constraints using bit-scaling
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Two-halfspace closure
The cutting plane method is polynomial for perfect matchings
Strengthening Chvátal-Gomory cuts for the stable set problem
A fixed point iterative approach to integer programming and its distributed computation
Rank of random half-integral polytopes. Extended abstract
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Solving nonlinear integer arithmetic with MCSAT
Helly’s theorem: New variations and applications
On the Chvàtal rank of linear relaxations of the stable set polytope
A note on the Chvàtal-Rank of clique family inequalities
On the Chvátal-Gomory closure of a compact convex set

This page was built for publication: Outline of an algorithm for integer solutions to linear programs

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