An interactive procedure for multiple objective integer linear programming problems
From MaRDI portal
Publication:1309911
DOI10.1016/0377-2217(93)90190-XzbMath0782.90079OpenAlexW2036556760MaRDI QIDQ1309911
Jasmina N. Karaivanova, Subhash C. Narula, Vassil Vassilev
Publication date: 28 February 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90190-x
Integer programming (90C10) Multi-objective and goal programming (90C29) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (14)
An interactive algorithm for solving multiple objective integer linear programming problems ⋮ An integrated approach for stock evaluation and portfolio optimization ⋮ An improved algorithm for solving biobjective integer programs ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration ⋮ Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming ⋮ Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems ⋮ Multi-objective optimization over convex disjunctive feasible sets using reference points ⋮ A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems ⋮ An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
Cites Work
- A multiple objective interactive Lagrangean relaxation approach
- 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
- A modified weighted Tchebycheff metric for multiple objective programming
- An algorithm for the multiple objective integer linear programming problem
- An interactive dynamic programming approach to multicriteria discrete programming
- Solving zero-one multiple objective programs through implicit enumeration
- An Algorithm for Multiobjective Zero-One Linear Programming
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- A Survey of Lagrangean Techniques for Discrete Optimization
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An interactive procedure for multiple objective integer linear programming problems
