A branch-and-bound algorithm for the singly constrained assignment problem-Reference-Cited by-同舟云学术

A branch-and-bound algorithm for the singly constrained assignment problem

Published:2007-01 Issue:1 Volume:176 Page:151-164
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Lieshout P.M.D.,Volgenant A.

Publisher

Elsevier BV

Subject

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

Reference14 articles.

1. A Lagrangean-relaxation method for the constrained assignment problem;Aggarwal;Computers and Operations Research,1985

2. Algorithms and codes for dense assignment problems: The state of the art;Dell’Amico;Discrete Applied Mathematics,2000

3. Dongarra, J.J., 2004. Performance of various computers using standard linear equations software, University of Tennessee Computer Science Technical Report. Available from: .

4. The Lagrangian-relaxation method for solving integer programming-problems;Fisher;Management Science,1981

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

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

1. Scheduling in a two-stage flowshop with parallel unrelated machines at each stage and shared resources;Computers & Industrial Engineering;2018-12

2. Exact solution approaches for bilevel assignment problems;Computational Optimization and Applications;2015-11-11

3. Multipurpose machine scheduling with rejection and identical job processing times;Journal of Scheduling;2014-07-05

4. A Heuristic Algorithm for Solving the Network Expanded Problem on Wireless ATM Environment;Lecture Notes in Computer Science