Pages that link to "Item:Q4262981"
From MaRDI portal
The following pages link to Polyhedral techniques in combinatorial optimization II: applications and computations (Q4262981):
Displaying 14 items.
- Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309) (← links)
- A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes) (Q1854113) (← links)
- Theory and methods of Euclidian combinatorial optimization: current status and prospects (Q2215570) (← links)
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- (Q3618862) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- On disjunctive cuts for combinatorial optimization (Q5952319) (← links)
