Improved Lagrangean decomposition: An application to the generalized assignment problem-Reference-Cited by-同舟云学术

Improved Lagrangean decomposition: An application to the generalized assignment problem

Published:1990-05 Issue:1 Volume:46 Page:84-92
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Barcia Paulo,Jörnsten Kurt

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference17 articles.

1. The bound improving sequence algorithm;Barcia;Operations Research Letters,1985

2. Constructive dual methods for discrete programming;Barcia;Discrete Applied Mathematics,1987

3. Improving Lagrangean decomposition: Some theoretical results;Barcia,1988

4. A revised bound improvement sequence algorithm;Barcia;European Journal of Operational Research,1988

5. Variable splitting and constructive duality: A method for structured integer programming;Barcia,1986

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Knapsack Problem and Its Variants: Formulations and Solution Methods;The Palgrave Handbook of Operations Research;2022

2. An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem;Mathematical Problems in Engineering;2018-07-22

3. Improved differential evolution algorithms for solving generalized assignment problem;Expert Systems with Applications;2016-03

4. Corrective Unit Commitment to an Unforeseen Unit Breakdown;IEEE Transactions on Power Systems;2012-11

5. A stochastic production planning problem with nonlinear cost;Computers & Operations Research;2012-09