scientific article
From MaRDI portal
Publication:3901292
zbMath0453.90054MaRDI QIDQ3901292
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsgeneralized assignment problemcomputational experience0-1 knapsack problemcapacitated facility location problemalgorithmic efficiencyparametric integer linear program
Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
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, Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item, A goal approach to assembly line balancing, 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, Modeling diminishing marginal returns in a hierarchical inventory system of repairable spare parts, AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, Parametric-objective integer programming using knapsack facets and Gomory cutting planes, The 0-1 knapsack problem with multiple choice constraints, Discrete right hand side parametrization for linear integer programs, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, A contraction for the multiparametric integer linear programming problem, Heuristic and exact algorithms for the simultaneous assignment problem, Efficient cuts in Lagrangean `relax-and-cut' schemes, Sensitivity analysis of a greedy heuristic for knapsack problems, A branch-and-bound algorithm for 0-1 parametric mixed integer programming, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
