Pages that link to "Item:Q1025985"
From MaRDI portal
The following pages link to On the choice of explicit stabilizing terms in column generation (Q1025985):
Displaying 50 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
- An exact approach to extend network lifetime in a general class of wireless sensor networks (Q781952) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- A comparison of formulations and relaxations for cross-dock door assignment problems (Q1652605) (← links)
- Dynamic constraint and variable aggregation in column generation (Q1683120) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Row-reduced column generation for degenerate master problems (Q2356253) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems (Q2433389) (← links)
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems (Q2436644) (← links)
- Interior point stabilization for column generation (Q2465956) (← links)
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example (Q2514747) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- A multiperiod drayage problem with customer-dependent service periods (Q2668610) (← links)
- A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime (Q2669701) (← links)
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- A note on the primal-dual column generation method for combinatorial optimization (Q2840728) (← links)
- Solutions diversification in a column generation algorithm (Q2865859) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- Dual-Optimal Inequalities for Stabilized Column Generation (Q3391991) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
- School bus routing—a column generation approach (Q4980002) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource (Q5059351) (← links)
