Publication:3901292

Publication date: 1979

algorithms; generalized assignment problem; computational experience; 0-1 knapsack problem; capacitated facility location problem; algorithmic efficiency; parametric integer linear program

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C31: Sensitivity, stability, parametric optimization

90B35: Deterministic scheduling theory in operations research

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Parametric-objective integer programming using knapsack facets and Gomory cutting planes, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, A branch-and-bound algorithm for 0-1 parametric mixed integer programming, On the use of internal rate of return in linear and integer programming, Marginal values in mixed integer linear programming, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, The 0-1 knapsack problem with multiple choice constraints, Discrete right hand side parametrization for linear integer programs, A contraction for the multiparametric integer linear programming problem, Efficient cuts in Lagrangean `relax-and-cut' schemes, Heuristic and exact algorithms for the simultaneous assignment problem, Modeling diminishing marginal returns in a hierarchical inventory system of repairable spare parts, Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item, Sensitivity analysis of a greedy heuristic for knapsack problems, A goal approach to assembly line balancing, Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study, Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme