The following pages link to GCG (Q22492):
Displaying 27 items.
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- Optimized load planning for motorail transportation (Q342294) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Learning when to use a decomposition (Q2011591) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
- Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- A branch-and-price-and-cut approach for sustainable crop rotation planning (Q2629731) (← links)
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation (Q3009749) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- Structure Detection in Mixed-Integer Programs (Q5136081) (← links)
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations (Q5140720) (← links)
- Primal Heuristics for Branch-and-Price Algorithms (Q5176283) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing (Q5746704) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
