Pages that link to "Item:Q922948"
From MaRDI portal
The following pages link to Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948):
Displaying 25 items.
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- A multi-product loading problem: A model and solution method (Q1278990) (← links)
- The return plant location problem: Modelling and resolution (Q1291663) (← links)
- Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
- A bound-improving approach to discrete programming problems (Q1340059) (← links)
- Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
- Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
- An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem (Q1721218) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- A stochastic production planning problem with nonlinear cost (Q1761117) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- A note on splitting of variables in integer programming models (Q1972004) (← links)
- Comparison of Lagrangian bounds for one class of generalized assignment problems (Q3545175) (← links)
- Lagrangean decomposition for integer programming : theory and applications (Q3780006) (← links)
- Solving the generalized knapsack problem with variable coefficients (Q5687641) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
