Pages that link to "Item:Q3418117"
From MaRDI portal
The following pages link to Acceleration of cutting-plane and column generation algorithms: Applications to network design (Q3418117):
Displaying 41 items.
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- Speeding up column generation for robust wireless network planning (Q743642) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- The rank pricing problem with ties (Q2239986) (← links)
- Dynamic multi-appointment patient scheduling for radiation therapy (Q2253376) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization (Q2783479) (← links)
- Using extra dual cuts to accelerate column generation (Q2890465) (← links)
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver (Q4685752) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems (Q5058013) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks (Q6087570) (← links)
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs (Q6112748) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones (Q6130706) (← links)
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)
- Three network design problems for community energy storage (Q6659084) (← links)
