Solving the generalised assignment problem using polyhedral results-Reference-Cited by-同舟云学术

Solving the generalised assignment problem using polyhedral results

Published:1998-08 Issue:3 Volume:108 Page:618-628
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Cattrysse Dirk,Degraeve Zeger,Tistaert Jurgen

Publisher

Elsevier BV

Subject

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

Reference17 articles.

1. Facets of the knapsack polytope;Balas;Mathematical Programming,1975

2. Facets of the knapsack polytope from minimal covers;Balas;SIAM Journal on Applied Mathematics,1978

3. A property of assignment type mixed integer linear programming problems;Benders;Operations Research Letters,1983

4. The snow disposal assignment problem;Campbell;Journal of the Operational Research Society,1995

5. Set partitioning approaches to combinatorial optimisation problems;Cattrysse,1990

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

1. Instance Space Analysis for the Generalized Assignment Problem;Metaheuristics;2023

2. The Generalized Assignment Problem;Matheuristics;2021

3. A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities;Discrete Applied Mathematics;2019-12

4. Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem;4OR;2018-09-24

5. Cover Inequalities;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15