Pages that link to "Item:Q1824554"

The following pages link to An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554):

Displaying 13 items.

• About Lagrangian methods in integer optimization (Q817183) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
• Auxiliary tool allocation in flexible manufacturing systems (Q1266742) (← links)
• The return plant location problem: Modelling and resolution (Q1291663) (← links)
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
• A multiperiod two-echelon multicommodity capacitated plant location problem (Q1569931) (← links)
• Development and evaluation of an assignment heuristic for allocating cross-trained workers (Q1600882) (← links)
• Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
• Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)