GCG

swMATH10533MaRDI QIDQ22492FDOQ22492

Author name not available (Why is that?)

Cited In (27)

• Primal Heuristics for Branch-and-Price Algorithms
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems
• Dantzig-Wolfe reformulations for binary quadratic problems
• Random sampling and machine learning to understand good decompositions
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
• A branch-price-and-cut algorithm for packing cuts in undirected graphs
• Could we use a million cores to solve an integer program?
• Exact approaches for designing multifacility buy-at-bulk networks
• Partial convexification of general mips by Dantzig-Wolfe reformulation
• Structure Detection in Mixed-Integer Programs
• Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
• Increasing the revenue of self-storage warehouses by optimizing order scheduling
• Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
• Learning when to use a decomposition
• Split cuts from sparse disjunctions
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• Optimized load planning for motorail transportation
• Decomposition Branching for Mixed Integer Programming
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing
• Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs
• A branch-and-price-and-cut approach for sustainable crop rotation planning

This page was built for software: GCG