The following pages link to (Q4354953):
Displaying 29 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce (Q323020) (← links)
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks (Q337548) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem (Q1694820) (← links)
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- A column generation heuristic for optimal wireless sensor network design with mobile sinks (Q1753436) (← links)
- Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- An exact approach for the personnel task rescheduling problem with task retiming (Q2242295) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example (Q2514747) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production (Q3005835) (← links)
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← 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)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
