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

DOI10.1016/S0377-2217(97)00104-5MaRDI QIDQ1296795zbMATH OpenFDO

Authors 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

combinatorial optimizationinteger programmingtransportationassignmentcombinatorial analysisgeneralized assignment problemheuristic sensitivityvariable-depth-search heuristic

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 969937
• Sensitivity analysis for scheduling problems
• Sensitivity analysis for scheduling problems
• Sensitivity analysis of a greedy heuristic for knapsack problems
• Global Sensitivity Analysis

Cites work

• scientific article; zbMATH DE number 3989103 (Why is no real title available?)
• scientific article; zbMATH DE number 3743004 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• scientific article; zbMATH DE number 3564693 (Why is no real title available?)
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• A hybrid heuristic for the generalized assignment problem
• A new Lagrangian relaxation approach to the generalized assignment problem
• A property of assignment type mixed integer linear programming problems
• A robust heuristic for the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• Discrete right hand side parametrization for linear integer programs
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Modeling Facility Location Problems as Generalized Assignment Problems
• Needed: An Empirical Science of Algorithms
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• Sensitivity Analysis for Branch and Bound Integer Programming
• Tabu search for the multilevel generalized assignment problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem

Cited in

(3)

• Heuristic stability: a permutation disarray measure
• A Survey of the Generalized Assignment Problem and Its Applications
• Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296795)