Outline of an algorithm for integer solutions to linear programs
From MaRDI portal
Publication:3256638
DOI10.1090/S0002-9904-1958-10224-4zbMath0085.35807WikidataQ30053163 ScholiaQ30053163MaRDI QIDQ3256638
Publication date: 1958
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Redundant robust topology optimization of truss, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, On some sequencing problems, Rank of random half-integral polytopes — extended abstract —, Rückgerechnete Duale Variable, Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes, On a Generalization of the Chvátal-Gomory Closure, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, The Boolean Quadric Polytope, MIPping closures: An instant survey, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, Communication Lower Bounds via Critical Block Sensitivity, 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, Convex analysis in groups and semigroups: a sampler, Unnamed Item, When the Gomory-chvátal closure coincides with the integer hull, Polyhedral Combinatorics in Combinatorial Optimization, Spherical cuts for integer programming problems, On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube, Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective, Foundations of operations research: from linear programming to data envelopment analysis, Complexity, algorithmic, and computational aspects of a dial-a-ride type problem, Optimal Cutting Planes from the Group Relaxations, Integer feasibility and refutations in UTVPI constraints using bit-scaling, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Solving Nonlinear Integer Arithmetic with MCSAT, 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, Two-halfspace closure, Helly’s theorem: New variations and applications, Matrices of rational integers, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme, Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, On the Chvátal rank of linear relaxations of the stable set polytope, A note on the Chvátal-rank of clique family inequalities, Classical cuts for mixed-integer programming and branch-and-cut, Approximate and exact merging of knapsack constraints with cover inequalities, On the Chvátal-Gomory Closure of a Compact Convex Set, Design and Verify: A New Scheme for Generating Cutting-Planes, Solving 0-1 programming problems by a penalty approach., Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Projected Chvátal-Gomory cuts for mixed integer linear programs, Branch and cut methods for network optimization, The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope, Elementary closures for integer programs., A constraint generation algorithm for large scale linear programs using multiple-points separation, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), Resolution Width and Cutting Plane Rank Are Incomparable, Unnamed Item, The Complexity of Propositional Proofs, Cutting to the Chase Solving Linear Integer Arithmetic, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, The Cutting Plane Method is Polynomial for Perfect Matchings, A simple effective heuristic for embedded mixed-integer quadratic programming, CUTTING PLANE WITH NON-UNIFORM DISTRIBUTIONS, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming, Men and progress in linear programming, Polyhedral techniques in combinatorial optimization I: Theory, Theory of majority decision elements, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, Valid inequalities, cutting planes and integrality of the knapsack polytope, Strengthening Chvátal-Gomory Cuts for the Stable Set Problem, An outline of linear programming, Gomory cuts revisited, Virtual private network design over the first Chvátal closure, The allocation of shared fixed costs, A model for discrete-variable linear programming, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, A geometric approach to cut-generating functions, Cutting to the chase., Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts, Polyhedral proof methods in combinatorial optimization, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Solution approaches for highly primal- and dual-degenerate all-integer programming problems, An advanced start algorithm for all-integer programming, A fixed point iterative approach to integer programming and its distributed computation, Solving \(0/1\) integer programs with enumeration cutting planes, Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, A simple strategy for solving a class of 0-1 integer programming models, The mixed cutting plane algorithm for all-integer programming, Individuals, populations and fluid approximations: a Petri net based perspective, The application of valid inequalities to the multi-stage lot-sizing problem, A new procedure for solving integer linear programming problems, Origin and early evolution of corner polyhedra, An algorithm for solving parametric integer program, Theoretical challenges towards cutting-plane selection, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, 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, Mixed-integer cuts from cyclic groups, An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane, Systems theory and evidence-based decision-making as keys for arbitrating between optimal production and efficient maintenance: a case study, On cutting-plane proofs in combinatorial optimization, Optimizing over the first Chvátal closure, Submodularity and the traveling salesman problem, On the enumerative nature of Gomory's dual cutting plane method, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, A survey of dual-feasible and superadditive functions, Extended formulation for hop constrained distribution network configuration problems, Comments on practical implementation of Gomory's fractional algorithm, Integral simplex using decomposition with primal cutting planes, Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank, A simple finite cutting plane algorithm for integer programs, Outer-product-free sets for polynomial optimization and oracle-based cuts, Dominance rules in combinatorial optimization problems, 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, Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems, Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube, Random half-integral polytopes, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, Rational and integral \(k\)-regular matrices., Lexicography and degeneracy: Can a pure cutting plane algorithm work?, The mixing-MIR set with divisible capacities, A randomized sieving algorithm for approximate integer programming, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, The stable set polytope of quasi-line graphs, George Dantzig's contributions to integer programming, George Dantzig's impact on the theory of computation, Integer linear programming for the Bayesian network structure learning problem, Ising formulations of some graph-theoretic problems in psychological research: models and methods, Learning discrete decomposable graphical models via constraint optimization, 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, 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, Three enhancements for optimization-based bound tightening, An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers, Equitable representation and recruitment, A survey of the operational use of ILP models, Cutting planes in integer and mixed integer programming, On the complexity of cutting-plane proofs using split cuts, Cutting plane algorithms for \(0-1\) programming based on cardinality cuts, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, Polyhedral approximations of the semidefinite cone and their application, Tactical optimization of the oil palm agribusiness supply chain, Influence of the normalization constraint on the integral simplex using decomposition, Improving set partitioning problem solutions by zooming around an improving direction, 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, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, A geometric characterization of ``optimality-equivalent relaxations, Large-scale 0-1 linear programming on distributed workstations, Strengthened clique-family inequalities for the stable set polytope, On the Chvátal rank of the pigeonhole principle, Computing in combinatorial optimization, On matroid parity and matching polytopes, Solving the prize-collecting rural postman problem, Hybridizing exact methods and metaheuristics: a taxonomy, Stable sets, corner polyhedra and the Chvàtal closure, 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 surrogating 0-1 knapsack constraints, A primal dual integer programming algorithm, A finitely converging cutting plane technique, Optimal project selection when borrowing and lending rates differ, An implicit branch-and-bound algorithm for mixed-integer linear programming, Cutting planes in combinatorics, On a generalization of the Chvátal-Gomory closure, On dedicated CDCL strategies for PB solvers, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Logical processing for integer programming, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
