Acceleration of cutting-plane and column generation algorithms: Applications to network design
From MaRDI portal
Publication:3418117
DOI10.1002/net.20137zbMath1131.90047OpenAlexW4234009545MaRDI QIDQ3418117
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20137
Related Items
Reformulating the disjunctive cut generating linear program, Implementing Automatic Benders Decomposition in a Modern MIP Solver, Routing of uncertain traffic demands, Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, Benders decomposition without separability: a computational study for capacitated facility location problems, A Benders decomposition based framework for solving cable trench problems, A Scalable Algorithm for Sparse Portfolio Selection, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, Benders decomposition for network design covering problems, Mixed-integer formulations for the capacitated rank pricing problem with envy, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks, The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Solving a continuous local access network design problem with a stabilized central column generation approach, Coordinated cutting plane generation via multi-objective separation, Reflections on generating (disjunctive) cuts, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching, The rank pricing problem with ties, Integer linear programming for the Bayesian network structure learning problem, Solving the optimum communication spanning tree problem, Solving minimum-cost shared arborescence problems, Dynamic multi-appointment patient scheduling for radiation therapy, A constraint generation algorithm for large scale linear programs using multiple-points separation, Models and algorithms for the product pricing with single-minded customers requesting bundles, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, A geometric characterization of ``optimality-equivalent relaxations, Chebyshev center based column generation, Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics, Interval scheduling with economies of scale
Uses Software
Cites Work
