Deriving compact extended formulations via LP-based separation techniques (Q5925168): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-015-2012-4
@@ Property / DOI: 10.1007/s10479-015-2012-4 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-015-2012-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1977974598
@@ Property / OpenAlex ID: W1977974598 / rank @@
+Normal rank
@@ Property / cites work @@
+On cuts and matchings in planar graphs
@@ Property / cites work: On cuts and matchings in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments in quadratic 0-1 programming
@@ Property / cites work: Experiments in quadratic 0-1 programming / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Price: Column Generation for Solving Huge Integer Programs
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting Permutations by Reversals and Eulerian Cycle Decompositions
+Normal rank
@@ Property / cites work @@
+Sorting Permutations by Reversals Through Branch-and-Price
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compact vs. exponential-size LP relaxations
@@ Property / cites work: Compact vs. exponential-size LP relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+Compact optimization can outperform separation: a case study in structural proteomics
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+LP models for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+Linear vs. semidefinite extended formulations
@@ Property / cites work: Linear vs. semidefinite extended formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for minimum routing cost trees
@@ Property / cites work: Exact algorithms for minimum routing cost trees / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting plane versus compact formulations for uncertain (integer) linear programs
+Normal rank
@@ Property / cites work @@
+Matrices with the Edmonds-Johnson property
@@ Property / cites work: Matrices with the Edmonds-Johnson property / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Solution of large-scale symmetric travelling salesman problems
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / cites work @@
+Constructing Extended Formulations from Reflection Relations
+Normal rank
@@ Property / cites work @@
+A time-indexed LP-based approach for min-sum job-shop problems
+Normal rank
@@ Property / cites work @@
+An effective compact formulation of the max cut problem on sparse graphs
+Normal rank
@@ Property / cites work @@
+Deriving compact extended formulations via LP-based separation techniques
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+On the Robust Knapsack Problem
@@ Property / cites work: On the Robust Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solution of the robust knapsack problem
@@ Property / cites work: Exact solution of the robust knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
+Normal rank
@@ Property / cites work @@
+On compact formulations for integer programs solved by column generation
+Normal rank
@@ Property / DOI @@
+.1007/S10479-015-2012-4
@@ Property / DOI: 10.1007/S10479-015-2012-4 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5925168