Polyhedral combinatorics and combinatorial optimization
From MaRDI portal
Recommendations
Cited in
(31)- Polymatroids: Construction and random algorithms
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- An analog of the Cook theorem for polytopes
- Convex combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Matching polytons
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Matroids and combinatorial optimisation
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
- scientific article; zbMATH DE number 3887435 (Why is no real title available?)
- scientific article; zbMATH DE number 3876926 (Why is no real title available?)
- Reducibility among combinatorial problems
- scientific article; zbMATH DE number 4083375 (Why is no real title available?)
- scientific article; zbMATH DE number 4108497 (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?)
- Topics of polyhedral combinatorics in transportation problems with exclusions
- Polyhedral techniques in combinatorial optimization II: applications and computations
- scientific article; zbMATH DE number 702975 (Why is no real title available?)
- Polyhedral techniques in combinatorial optimization I: Theory
- scientific article; zbMATH DE number 4114386 (Why is no real title available?)
- An ancient combinatorial problem
- Compact representations of all members of an independence system
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Combinatorial Optimization in Pattern Assembly
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Uncapacitated flow-based extended formulations
- Recent trends in combinatorial optimization
- On a problem of integer optimization
This page was built for publication: Polyhedral combinatorics and combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374106)
