A property of assignment type mixed integer linear programming problems
From MaRDI portal
Publication:1837110
DOI10.1016/0167-6377(83)90035-4zbMath0506.90060OpenAlexW1963627056MaRDI QIDQ1837110
J. A. E. E. Van Nunen, J. F. Benders
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/a-property-of-assignment-type-mixed-integer-linear-programming-problems(c1d32474-056f-4c6e-b521-8721d1fc0753).html
linear programming relaxationdistribution problemsassignment type mixed integer linear programminglocation allocation problemstight upper bounds
Related Items
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Robust vehicle routing DSS and road networks on a European scale? ⋮ Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Redesigning a warehouse network ⋮ Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints ⋮ Probabilistic analysis of the generalised assignment problem ⋮ Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs ⋮ A survey of algorithms for the generalized assignment problem ⋮ A tabu search heuristic for the generalized assignment problem ⋮ The stochastic transportation problem with single sourcing ⋮ An algorithm for the generalized quadratic assignment problem ⋮ Using the generalized assignment problem in scheduling the ROSAT space telescope ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Optimizing barge utilization in hinterland container transportation ⋮ A class of greedy algorithms for the generalized assignment problem ⋮ A property of assignment type mixed integer linear programming problems ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study ⋮ Solving the generalised assignment problem using polyhedral results ⋮ Designing distribution systems with transport economies of scale ⋮ A set partitioning heuristic for the generalized assignment problem
Cites Work
