scientific article; zbMATH DE number 3904331
From MaRDI portal
Publication:3682240
Recommendations
Cited in
(67)- Clique facets of the axial and planar assignment polytopes
- On the system of two all different\(\_\)predicates
- Cutting planes in combinatorics
- Polyhedral proof methods in combinatorial optimization
- Generalized polymatroids and submodular flows
- Forest covers and a polyhedral intersection theorem
- The 2-matching lattice of a graph
- Polyhedral results for a vehicle routing problem
- A spectral method for concordant polyhedral faces
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- Facets of two Steiner arborescence polyhedra
- The traveling salesman problem in graphs with some excluded minors
- A weighted min-max relation for intervals
- Adjacency of the 0-1 knapsack problem
- Matching theory -- a sampler: From Dénes König to the present
- The complexity of lifted inequalities for the knapsack problem
- On the dimension of projected polyhedra
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- The facets of the polyhedral set determined by the Gale-Hoffman inequalities
- Near-perfect matrices
- Stable matchings and linear inequalities
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Adjacency of vertices of the complete pre-order polytope
- Some thoughts on combinatorial optimisation
- Polytopes, permutation shapes and bin packing
- An exact algorithm for the identical parallel machine scheduling problem.
- Survey of facial results for the traveling salesman polytope
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Combinatorial optimization and small polytopes
- On Latin squares and the facial structure of related polytopes
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Discrete polymatroids
- On greedy bases packing in matroids
- Stable matchings and linear programming
- The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On multi-index assignment polytopes
- k-edge connected polyhedra on series-parallel graphs
- Facet generating techniques
- scientific article; zbMATH DE number 4016609 (Why is no real title available?)
- scientific article; zbMATH DE number 3887434 (Why is no real title available?)
- scientific article; zbMATH DE number 3860890 (Why is no real title available?)
- scientific article; zbMATH DE number 4199652 (Why is no real title available?)
- scientific article; zbMATH DE number 3898612 (Why is no real title available?)
- On box totally dual integral polyhedra
- Polyhedral Combinatorics in Combinatorial Optimization
- scientific article; zbMATH DE number 4068909 (Why is no real title available?)
- scientific article; zbMATH DE number 4083375 (Why is no real title available?)
- scientific article; zbMATH DE number 24443 (Why is no real title available?)
- scientific article; zbMATH DE number 49751 (Why is no real title available?)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
- Combinatorially regular Euler polytopes
- scientific article; zbMATH DE number 6991368 (Why is no real title available?)
- scientific article; zbMATH DE number 863499 (Why is no real title available?)
- Polyhedra and optimization in connection with a weak majorization ordering
- scientific article; zbMATH DE number 4187465 (Why is no real title available?)
- The polytope of degree sequences
- On cycle cones and polyhedra
- Facets of the generalized permutahedron of a poset
- A note on matchings and separability
- Canonical equation sets for classes of concordant polytopes
- On the orthogonal Latin squares polytope
- LP-based solution methods for the asymmetric TSP
- On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
- The stable set polytope for some extensions of \(P_4\)-free graphs
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 Q3682240)
