Pages that link to "Item:Q3391990"
From MaRDI portal
The following pages link to Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation (Q3391990):
Displaying 12 items.
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Real-time vehicle rerouting problems with time windows (Q958553) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- An integer optimality condition for column generation on zero-one linear programs (Q2419361) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
- A meta-heuristic extension of the Lagrangian heuristic framework (Q6644992) (← links)
