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