Integer Rounding for Polymatroid and Branching Optimization Problems
From MaRDI portal
Cites work
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Blocking pairs of polyhedra arising from network flows
- Blocking, antiblocking, and pairs of matroids and polymatroids
- Cyclic Scheduling via Integer Programs with Circular Ones
- Finite checkability for integer rounding properties in combinatorial programming problems
- scientific article; zbMATH DE number 3655693 (Why is no real title available?)
- scientific article; zbMATH DE number 3628712 (Why is no real title available?)
- scientific article; zbMATH DE number 3345048 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Matroids and the greedy algorithm
- Minimum partition of a matroid into independent subsets
- Network Flows, Minimum Coverings, and the Four-Color Conjectures
- Normal hypergraphs and the perfect graph conjecture
- Transversals and matroid partition
- Unnetworks, with Applications to Idle Time Scheduling
Cited in
(45)- An instance of the cutting stock problem for which the rounding property does not hold
- On the chromatic index of multigraphs and a conjecture of Seymour (I)
- A simple strategy for solving a class of 0-1 integer programming models
- The modified integer round-up property of the one-dimensional cutting stock problem
- Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
- Near-perfect matrices
- Fractional and integral colourings
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- Integer rounding and modified integer rounding for the skiving stock problem
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- Tighter relaxations for the cutting stock problem
- Parametric formulation of the general integer linear programming problem
- A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- Membership criteria and containments of powers of monomial ideals
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- Normality criteria for monomial ideals
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- The \(b\)-branching problem in digraphs
- A rounding theorem for unique binary tomographic reconstruction
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- Bounds for the Nakamura number
- A feasible rounding approach for mixed-integer optimization problems
- Large proper gaps in bin packing and dual bin packing problems
- An asymptotically exact algorithm for the high-multiplicity bin packing problem
- Error bounds for mixed integer linear optimization problems
- Polyhedral sets and integer rounding
- Error bounds for mixed integer nonlinear optimization problems
- Bin packing and related problems: general arc-flow formulation with graph compression
- A decomposition property of polyhedra
- The cutting stock problem and integer rounding
- Testing additive integrality gaps
- Packing and covering with integral feasible flows in integral supply-demand networks
- On some characterisations of totally unimodular matrices
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Integral decomposition in polyhedra
- Sensitive instances of the cutting stock problem
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Non-interfering network flows
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
- The proper relaxation and the proper gap of the skiving stock problem
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- Nested \((2,3)\)-instances of the cutting stock problem
- Approximation algorithms for scheduling unrelated parallel machines
This page was built for publication: Integer Rounding for Polymatroid and Branching Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668310)
