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

DOI10.1016/S0377-2217(97)00104-5zbMATH Open0943.90006MaRDI QIDQ1296795FDOQ1296795

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

Publication date: 10 September 2000

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

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

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)

Cites Work

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

Cited In (2)

• A Survey of the Generalized Assignment Problem and Its Applications
• Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining

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)