Pages that link to "Item:Q4262981"

The following pages link to Polyhedral techniques in combinatorial optimization II: applications and computations (Q4262981):

Displaying 7 items.

• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407) (← links)
• On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← 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)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)