scientific article; zbMATH DE number 3373541
From MaRDI portal
Publication:5645210
zbMath0235.90038MaRDI QIDQ5645210
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ 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 ⋮ Branch and cut methods for network optimization ⋮ Elementary closures for integer programs. ⋮ Narrow Proofs May Be Maximally Long ⋮ Rank of random half-integral polytopes — extended abstract — ⋮ Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ An advanced start algorithm for all-integer programming ⋮ A surrogate cutting plane algorithm for all-integer programming ⋮ Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts ⋮ MIPping closures: An instant survey ⋮ The mixed cutting plane algorithm for all-integer programming ⋮ Characterization of the split closure via geometric lifting ⋮ An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs ⋮ Binary extended formulations of polyhedral mixed-integer sets ⋮ On the facets of mixed integer programs with two integer variables and two constraints ⋮ On optimizing over lift-and-project closures ⋮ Scatter search and star-paths: Beyond the genetic metaphor ⋮ An abstract model for branch-and-cut ⋮ Total dual integrality and integer polyhedra ⋮ Polyhedra of regular p-nary group problems ⋮ Constructing the value function for an integer linear programme over a cone ⋮ Optimizing over the first Chvátal closure ⋮ On the enumerative nature of Gomory's dual cutting plane method ⋮ On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Combining and strengthening Gomory cuts ⋮ On the membership problem for the \({0, 1/2}\)-closure ⋮ Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank ⋮ On the relative strength of split, triangle and quadrilateral cuts ⋮ Cut generation through binarization ⋮ Optimal Cutting Planes from the Group Relaxations ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Dual row modules and polyhedra of blocking group problems ⋮ Two-halfspace closure ⋮ Enumerative inequalities in integer programming ⋮ Random half-integral polytopes ⋮ Facet Generating Techniques ⋮ Computational experience with a group theoretic integer programming algorithm ⋮ Coordinated cutting plane generation via multi-objective separation ⋮ How tight is the corner relaxation? Insights gained from the stable set problem ⋮ Lexicography and degeneracy: Can a pure cutting plane algorithm work? ⋮ Sensitivity theorems in integer linear programming ⋮ An upper bound on the number of cuts needed in Gomory's method of integer forms ⋮ Chvátal closures for mixed integer programming problems ⋮ Improved strategies for branching on general disjunctions ⋮ A note on the MIR closure ⋮ Hamiltonian location problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques ⋮ Solving 0-1 programming problems by a penalty approach. ⋮ Integer solutions via goal programming to hierarchical systems. ⋮ Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ Robust decision making using a general utility set ⋮ A new lift-and-project operator ⋮ Lattice Reformulation Cuts ⋮ Projected Chvátal-Gomory cuts for mixed integer linear programs ⋮ One modification of Gomory's algorithm ⋮ Revival of the Gomory cuts in the 1990's ⋮ Branch and bound, integer, and non-integer programming ⋮ Cutting planes in integer and mixed integer programming ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Starting-time decisions in labor tour scheduling: An experimental analysis and case study ⋮ On algorithms for discrete problems ⋮ Solving word equations ⋮ On convergence in mixed integer programming ⋮ Several notes on the power of Gomory-Chvátal cuts ⋮ Chvatal--Gomory--tier cuts for general integer programs ⋮ 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 ⋮ Understanding cutting planes for QBFs ⋮ A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set ⋮ Valid inequalities for mixed integer linear programs ⋮ SCIP: solving constraint integer programs ⋮ On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints ⋮ Using cutting planes to solve the symmetric Travelling Salesman problem ⋮ An extension of Hu's group minimization algorithm ⋮ Cutting-plane theory: Algebraic methods ⋮ 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 ⋮ Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation ⋮ A recursive procedure to generate all cuts for 0-1 mixed integer programs ⋮ Cutting-plane proofs in polynomial space ⋮ Some polyhedra related to combinatorial problems ⋮ Combinatorial optimization and small polytopes ⋮ Faces of the Gomory polyhedron for cyclic groups ⋮ Integer programming duality: Price functions and sensitivity analysis ⋮ Transformation of integer programs to knapsack problems ⋮ Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems ⋮ Gomory cuts revisited ⋮ The aggregation closure is polyhedral for packing and covering integer programs ⋮ The value function of an integer program ⋮ Constructive characterizations of the value-function of a mixed-integer program. I
This page was built for publication:
