scientific article; zbMATH DE number 3333883
From MaRDI portal
Publication:5611528
Cited in
(22)- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Discrete extremal problems
- A characterization of the uncapacitated network design polytope
- Main directions in the development of informatics
- Integral simplex using decomposition with primal cutting planes
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Addendum to: ``Vertex adjacencies in the set covering polyhedron
- Adjacency on combinatorial polyhedra
- Some directions and results of research in mathematical programming and system analysis
- All-integer column generation for set partitioning: basic principles and extensions
- Some recognition problems related to graph isomorphism
- Simplex pivots on the set packing polytope
- The Hirsch conjecture for the fractional stable set polytope
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- On the facial structure of set packing polyhedra
- The cut cone. III: On the role of triangle facets
- The cut cone. III: On the role of triangle facets
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
- On skeletons, diameters and volumes of metric polyhedra
- Pseudo-Boolean optimization
- Influence of the normalization constraint on the integral simplex using decomposition
- Column generation in the integral simplex method
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 Q5611528)
