Pages that link to "Item:Q4715790"

The following pages link to Polyhedral techniques in combinatorial optimization I: Theory (Q4715790):

Displaying 19 items.

• Recent trends in combinatorial optimization (Q788638) (← links)
• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407) (← links)
• Some thoughts on combinatorial optimisation (Q1388818) (← links)
• Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
• Compact optimization can outperform separation: a case study in structural proteomics (Q1762887) (← links)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes) (Q1854113) (← links)
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Theory and methods of Euclidian combinatorial optimization: current status and prospects (Q2215570) (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
• On the 2-Club Polytope of Graphs (Q2957469) (← links)
• Polyhedral combinatorics and combinatorial optimization (Q3374106) (← links)
• Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
• Polyhedral Characterization of Discrete Dynamic Programming (Q3496158) (← links)
• Extracts from the history of combinatorial optimization (Q3615428) (← links)
• (Q3673576) (← links)
• Polyhedral techniques in combinatorial optimization II: applications and computations (Q4262981) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)