An interactive procedure for multiple objective integer linear programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3891118
- A simplified interactive multiple objective linear programming procedure
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- scientific article; zbMATH DE number 3978851
- An interactive algorithm for solving multiple objective integer linear programming problems
Cites work
- scientific article; zbMATH DE number 3891118 (Why is no real title available?)
- scientific article; zbMATH DE number 3891122 (Why is no real title available?)
- scientific article; zbMATH DE number 3978851 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3679572 (Why is no real title available?)
- scientific article; zbMATH DE number 3550466 (Why is no real title available?)
- scientific article; zbMATH DE number 3566554 (Why is no real title available?)
- scientific article; zbMATH DE number 3593321 (Why is no real title available?)
- scientific article; zbMATH DE number 1460273 (Why is no real title available?)
- scientific article; zbMATH DE number 3999655 (Why is no real title available?)
- A Survey of Lagrangean Techniques for Discrete Optimization
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- A modified weighted Tchebycheff metric for multiple objective programming
- A multiple objective interactive Lagrangean relaxation approach
- An Algorithm for Multiobjective Zero-One Linear Programming
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- An interactive dynamic programming approach to multicriteria discrete programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- Solving zero-one multiple objective programs through implicit enumeration
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Zero-one programming with multiple criteria
Cited in
(32)- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- scientific article; zbMATH DE number 3891118 (Why is no real title available?)
- scientific article; zbMATH DE number 3978851 (Why is no real title available?)
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- scientific article; zbMATH DE number 4202009 (Why is no real title available?)
- A simplified interactive multiple objective linear programming procedure
- scientific article; zbMATH DE number 1784652 (Why is no real title available?)
- An improved algorithm for solving biobjective integer programs
- Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures
- 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
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions
- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
- An interactive multiobjective nonlinear programming procedure
- Cutting plane method for multiple objective stochastic integer linear programming
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- An interactive MOLP procedure using epsilon-constraints
- An interactive approximation algorithm for multi-objective integer programs
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Analysis and synthesis of engineering systems for the preparation and making of decisions under multiple criteria
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- An integrated approach for stock evaluation and portfolio optimization
- scientific article; zbMATH DE number 1086970 (Why is no real title available?)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration
- scientific article; zbMATH DE number 956508 (Why is no real title available?)
- An interactive algorithm for solving multiple objective 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
- scientific article; zbMATH DE number 3976762 (Why is no real title available?)
This page was built for publication: An interactive procedure for multiple objective integer linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309911)
