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