Pages that link to "Item:Q1082268"
From MaRDI portal
The following pages link to Polyhedral proof methods in combinatorial optimization (Q1082268):
Displaying 39 items.
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309) (← links)
- Social exchange networks with distant bargaining (Q744107) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Generic global rigidity of body-hinge frameworks (Q905896) (← links)
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion (Q954963) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- A generalization of Robacker's theorem (Q1118612) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- An analog of the Cook theorem for polytopes (Q1759309) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- On matching numbers of tree and bipartite degree sequences (Q1999734) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- Normality criteria for monomial ideals (Q2103343) (← links)
- Some new results on generalized additive games (Q2121459) (← links)
- Irreducible decomposition of powers of edge ideals (Q2178508) (← links)
- Circular zero-sum \(r\)-flows of regular graphs (Q2191265) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- On line sum optimization (Q2228118) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues (Q2417161) (← links)
- Combinatorial optimization. Packing and covering (Q2716048) (← links)
- (Q2999656) (← links)
- Geometric methods in discrete optimization (Q3028730) (← links)
- Unions of perfect matchings in cubic graphs (Q3439362) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419) (← links)
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base (Q4018150) (← links)
- Polyhedral techniques in combinatorial optimization II: applications and computations (Q4262981) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization (Q5499737) (← links)
- Polyhedral combinatorics - some recent developments and results (Q5752291) (← links)
- An incentive compatible, efficient market for air traffic flow management (Q5918109) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)