Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
From MaRDI portal
Publication:3948895
DOI10.1007/BF01584241zbMath0487.90086MaRDI QIDQ3948895
Mark H. Karwan, Bernardo Villarreal
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Dynamic programming (90C39)
Related Items
Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, An algorithm for the bi-criterion integer programming problem, A class of practical interactive branch and bound algorithms for multicriteria integer programming, Zero-one programming with multiple criteria, Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective, On upper approximations of Pareto fronts, Drilling strategies for frontier areas, Dynamic programming algorithms for the bi-objective integer knapsack problem, An interactive algorithm for solving multiple objective integer linear programming problems, Unnamed Item, An algorithm for optimizing a linear function over an integer efficient set, An improved algorithm for solving biobjective integer programs, Algorithm robust for the bicriteria discrete optimization problem, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case, Unnamed Item, Algorithms for nonlinear integer bicriterion problems, A review of interactive methods for multiobjective integer and mixed-integer programming, Theory and applications of generalized dynamic programming: An overview, Preference programming for robust portfolio modeling and project selection, On a biobjective search problem in a line: formulations and algorithms, A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising, Modeling project preferences in multiattribute portfolio decision analysis, A solution procedure for general knapsack problems with a few constraints, Scenario-based portfolio selection of investment projects with incomplete probability and utility information, Robust portfolio modeling with incomplete cost information and project interdependencies, Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming, A survey of recent developments in multiobjective optimization, Efficient computation of the search region in multi-objective optimization, Multi-objective branch and bound, Scenario-based portfolio model for building robust and proactive strategies, The search-and-remove algorithm for biobjective mixed-integer linear programming problems, A time-dependent multiple criteria single-machine scheduling problem, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, Labeling algorithms for multiple objective integer knapsack problems, Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems, A branch and bound algorithm for mixed zero-one multiple objective linear programming, An interactive procedure for multiple objective integer linear programming problems, Multiobjective solution of the uncapacitated plant location problem, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
- Proper efficiency and the theory of vector maximization
- Some relationships between lagrangian and surrogate duality in integer programming
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Surrogate Constraint Duality in Mathematical Programming
- Branch-and-Bound Strategies for Dynamic Programming
- An Algorithm for Nonlinear Knapsack Problems
- Linear multiple objective programs with zero–one variables
- A hybrid approach to discrete mathematical programming
- Scheduling to Minimize Interaction Cost
- Surrogate Mathematical Programming
