scientific article; zbMATH DE number 3373541
From MaRDI portal
Publication:5645210
zbMATH Open0235.90038MaRDI QIDQ5645210FDOQ5645210
Authors: Ralph E. Gomory 
Publication date: 1963
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- The value function of an integer program
- A primal dual integer programming algorithm
- Branch and bound, integer, and non-integer programming
- Computational experience with a group theoretic integer programming algorithm
- On the membership problem for the \({0, 1/2}\)-closure
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Revival of the Gomory cuts in the 1990's
- Total dual integrality and integer polyhedra
- 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
- 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
- Integer programming duality: Price functions and sensitivity analysis
- 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?
- Starting-time decisions in labor tour scheduling: An experimental analysis and case study
- Solving 0-1 programming problems by a penalty approach.
- Constructive characterizations of the value-function of a mixed-integer program. I
- On the complexity of cutting-plane proofs
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- How tight is the corner relaxation? Insights gained from the stable set problem
- Cutting planes in combinatorics
- On the enumerative nature of Gomory's dual cutting plane method
- Characterization of the split closure via geometric lifting
- Optimizing over the first Chvátal closure
- Elementary closures for integer programs.
- Several notes on the power of Gomory-Chvátal cuts
- A branch and bound algorithm for the capacitated vehicle routing problem
- On the relative strength of split, triangle and quadrilateral cuts
- Improved strategies for branching on general disjunctions
- Lattice reformulation cuts
- Cut generation through binarization
- Some polyhedra related to combinatorial problems
- Cutting-plane theory: Algebraic methods
- Gomory cuts revisited
- Matchings and covers in hypergraphs
- Facet generating techniques
- 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
- SCIP: solving constraint integer programs
- Relaxations of mixed integer sets from lattice-free polyhedra
- Random half-integral polytopes
- Chvátal closures for mixed integer programming problems
- Airline crew scheduling: state-of-the-art
- Hamiltonian location problems
- Branch and cut methods for network optimization
- 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
- Non delayed relax-and-cut algorithms
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Transformation of integer programs to knapsack problems
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Sensitivity theorems in integer linear programming
- Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
- Constructive characterizations of the value function of a mixed-integer program. II
- Combinatorial optimization and small polytopes
- On optimizing over lift-and-project closures
- Coordinated cutting plane generation via multi-objective separation
- Chvatal--Gomory--tier cuts for general integer programs
- An advanced start algorithm for all-integer programming
- 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
- 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
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- An extension of Hu's group minimization algorithm
- An abstract model for branch and cut
- Optimal cutting planes from the group relaxations
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Polyhedra of regular p-nary group problems
- Enumerative inequalities in integer programming
- Integer solutions via goal programming to hierarchical systems.
- The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
- One modification of Gomory's algorithm
- Some contributions of Ailsa H. Land to the study of the traveling salesman problem
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- Binary extended formulations of polyhedral mixed-integer sets
- MIPping closures: An instant survey
- Constructing the value function for an integer linear programme over a cone
- On algorithms for discrete problems
- Understanding cutting planes for QBFs
- A new lift-and-project operator
- Solving word equations
- An abstract model for branch-and-cut
- Cutting planes width and the complexity of graph isomorphism refutations
- A geometric approach to cut-generating functions
- Two-halfspace closure
- Narrow proofs may be maximally long
- 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)
