Pages that link to "Item:Q1025985"

The following pages link to On the choice of explicit stabilizing terms in column generation (Q1025985):

Displaying 18 items.

• 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)