Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study

DOI10.1016/S0377-2217(97)00104-5zbMath0943.90006MaRDI QIDQ1296795

Mohammad M. Amini, Parviz Ghandforoush, Michael J. Racer

Publication date: 10 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingtransportationgeneralized assignment problemcombinatorial optimizationcombinatorial analysisassignmentheuristic sensitivityvariable-depth-search heuristic

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

A Survey of the Generalized Assignment Problem and Its Applications

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new Lagrangian relaxation approach to the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• Discrete right hand side parametrization for linear integer programs
• A robust heuristic for the generalized assignment problem
• Tabu search for the multilevel generalized assignment problem
• A hybrid heuristic for the generalized assignment problem
• A property of assignment type mixed integer linear programming problems
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Sensitivity Analysis for Branch and Bound Integer Programming
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Modeling Facility Location Problems as Generalized Assignment Problems
• Needed: An Empirical Science of Algorithms
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem

This page was built for publication: Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study