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)

Parametric integer linear programming: A synthesis of branch and bound with cutting planes
Classical cuts for mixed-integer programming and branch-and-cut
Combining metaheuristics with mathematical programming, constraint programming and machine learning
Strengthening Chvátal-Gomory cuts for the stable set problem
On a generalization of the Chvátal-Gomory closure
Rank of random half-integral polytopes. Extended abstract
On a generalization of the Chvátal-Gomory closure
Proving the infeasibility of Horn formulas through read-once resolution
Convex analysis in groups and semigroups: a sampler
A survey of the operational use of ILP models
Equitable representation and recruitment
A primal dual integer programming algorithm
Resolution Width and Cutting Plane Rank Are Incomparable
Lifting the knapsack cover inequalities for the knapsack polytope
Valid inequalities, cutting planes and integrality of the knapsack polytope
Stable set polytopes with high lift-and-project ranks for the Lovász-Schrijver SPD operator
Rational and integral \(k\)-regular matrices.
Shore hydrogen deployment problem in green ports
Strengthened clique-family inequalities for the stable set polytope
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
A new procedure for solving integer linear programming problems
On the tree augmentation problem
Matrices of rational integers
The Complexity of Propositional Proofs
A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
A simple finite cutting plane algorithm for integer programs
Last fifty years of integer linear programming: a focus on recent practical advances
A dedicated branch-price-and-cut algorithm for advance patient planning and surgeon scheduling
On dedicated CDCL strategies for PB solvers
Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
Polyhedral Combinatorics in Combinatorial Optimization
Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme
Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen
On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
Spherical cuts for integer programming problems
Polyhedral approximations of the semidefinite cone and their application
A finitely converging cutting plane technique
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
Primal separation and approximation for the \(\{0,1/2\}\)-closure
Chvátal-Gomory cuts for the Steiner tree problem
George Dantzig's contributions to integer programming
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
Men and progress in linear programming
A fixed point iterative approach to integer programming and its distributed computation
Solving resource allocation problems in disaster management using linear programming relaxations
On cutting-plane proofs in combinatorial optimization
A simple effective heuristic for embedded mixed-integer quadratic programming
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
Submodularity and the traveling salesman problem
Outer-product-free sets for polynomial optimization and oracle-based cuts
Extended formulation for hop constrained distribution network configuration problems
Optimal cutting planes from the group relaxations
Virtual private network design over the first Chvátal closure
An abstract model for branch and cut
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
On semantic cutting planes with very small coefficients
The mixing-MIR set with divisible capacities
Solving nonlinear integer arithmetic with MCSAT
scientific article; zbMATH DE number 7561762 (Why is no real title available?)
Combining metaheuristics with mathematical programming, constraint programming and machine learning
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
Theoretical challenges towards cutting-plane selection
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
Efficient reformulation for 0-1 programs -- methods and computational results
Theory of majority decision elements
Lexicography and degeneracy: Can a pure cutting plane algorithm work?
Comments on practical implementation of Gomory's fractional algorithm
Ising formulations of some graph-theoretic problems in psychological research: models and methods
Redundant robust topology optimization of truss
An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
On the mixed set covering, packing and partitioning polytope
An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
Influence of the normalization constraint on the integral simplex using decomposition
Solving 0-1 programming problems by a penalty approach.
Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
A survey of dual-feasible and superadditive functions
Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
Design and verify: A new scheme for generating cutting-planes
Polyhedral techniques in combinatorial optimization I: Theory
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
On the Chvàtal rank of linear relaxations of the stable set polytope
On the enumerative nature of Gomory's dual cutting plane method
DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
Solving \(0/1\) integer programs with enumeration cutting planes
Cutting planes in combinatorics
Individuals, populations and fluid approximations: a Petri net based perspective
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
Improving set partitioning problem solutions by zooming around an improving direction
A geometric characterization of ``optimality-equivalent relaxations
Convex analysis in groups and semigroups and applications to separation and optimization
Foundations of operations research: from linear programming to data envelopment analysis
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)