Pages that link to "Item:Q1396813"

The following pages link to The volume algorithm revisited: relation with bundle methods (Q1396813):

Displaying 33 items.

• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
• On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
• Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
• Algorithmic aspects of alternating sum of volumes. I: Data structure and difference operation (Q808222) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
• Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. (Q1427572) (← links)
• The volume algorithm: Producing primal solutions with a subgradient method (Q1575065) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem (Q1711458) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
• Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Comparison of bundle and classical column generation (Q2476993) (← links)
• New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)