Edmonds polytopes and a hierarchy of combinatorial problems
From MaRDI portal
Publication:2557712
Cites work
- A characterization of perfect graphs
- Anti-blocking polyhedra
- Edmonds polytopes and weakly hamiltonian graphs
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1953187 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3358500 (Why is no real title available?)
- scientific article; zbMATH DE number 3393943 (Why is no real title available?)
- Hypergraphs and Ramseyian Theorems
- Integral Extreme Points
- Letter to the Editor—A Note on the Branch-and-Bound Principle
- Maximum matching and a polyhedron with 0,1-vertices
- Minimum partition of a matroid into independent subsets
- Normal hypergraphs and the perfect graph conjecture
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Paths, Trees, and Flowers
- Remarks on a Problem of Moser
- Some remarks on the theory of graphs
- The complexity of theorem-proving procedures
- The Factorization of Linear Graphs
Cited in
(only showing first 100 items - show all)- A geometric characterization of ``optimality-equivalent relaxations
- Valid inequalities for mips and group polyhedra from approximate liftings
- On the Chvátal rank of the pigeonhole principle
- Stable sets, corner polyhedra and the Chvàtal closure
- A surprising permanence of old motivations (a not-so-rigid story)
- A finitely converging cutting plane technique
- Constructive characterizations of the value function of a mixed-integer program. II
- Cutting planes in combinatorics
- Polyhedral proof methods in combinatorial optimization
- Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem)
- Representability in mixed integer programming. I: Characterization results
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Matrices with the Edmonds-Johnson property
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On cutting-plane proofs in combinatorial optimization
- Logic applied to integer programming and integer programming applied to logic
- Comments on practical implementation of Gomory's fractional algorithm
- Polytope des independants d'un graphe série-parallèle
- Discrete extremal problems
- On total dual integrality
- On stable set polyhedra for K//(1,3)free graphs
- Circuits in graphs embedded on the torus
- A note on symmetric doubly-stochastic matrices
- Cutting-plane theory: Algebraic methods
- On surrogating 0-1 knapsack constraints
- A primal dual integer programming algorithm
- Logic cuts for processing networks with fixed charges
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
- Generalized resolution for 0--1 linear inequalities
- On certain polytopes associated with graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Totally tight Chvatal-Gomory cuts
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Theoretical challenges towards cutting-plane selection
- Limited memory rank-1 cuts for vehicle routing problems
- Kernels by properly colored paths in arc-colored digraphs
- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- On the mixed set covering, packing and partitioning polytope
- Integer programming as projection
- On semantic cutting planes with very small coefficients
- A branch-and-cut procedure for the Udine course timetabling problem
- Chvatal--Gomory--tier cuts for general integer programs
- 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
- Deterministic network interdiction
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Fractional matroid matchings
- Matchings and covers in hypergraphs
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Cutting-plane proofs in polynomial space
- Facets and algorithms for capacitated lot sizing
- A closed-form representation of mixed-integer program value functions
- On the partial order polytope of a digraph
- Constructing the value function for an integer linear programme over a cone
- On finitely generated closures in the theory of cutting planes
- On the Chvátal rank of polytopes in the 0/1 cube
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Strengthened clique-family inequalities for the stable set polytope
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
- Computing in combinatorial optimization
- The aggregation closure is polyhedral for packing and covering integer programs
- Numerical experiments with LP formulations of the maximum clique problem
- Computing the integer hull of convex polyhedral sets
- On a generalization of the Chvátal-Gomory closure
- On disks of the triangular grid: an application of optimization theory in discrete geometry
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Facets from gadgets
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Design and verify: a new scheme for generating cutting-planes
- On the Chvátal-Gomory closure of a compact convex set
- Facets of the three-index assignment polytope
- Tactical optimization of the oil palm agribusiness supply chain
- On the rational polytopes with Chvátal rank 1
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- Cutting to the chase.
- A note on quasi-kernels in digraphs
- The story of perfectly orderable graphs
- MIPping closures: An instant survey
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- On optimizing over lift-and-project closures
- When the Gomory-chvátal closure coincides with the integer hull
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
- 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
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Optimal placement of stereo sensors
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Several notes on the power of Gomory-Chvátal cuts
- Duality in mathematics and linear and integer programming
- Small Chvátal rank
- Chvátal-Gomory cuts for the Steiner tree problem
- On the tree augmentation problem
- Lifting the knapsack cover inequalities for the knapsack polytope
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Integer programming methods for solving binary interdiction games
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
This page was built for publication: Edmonds polytopes and a hierarchy of combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557712)
