Linear multiple objective programs with zero–one variables
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3516918 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
- Proper efficiency and the theory of vector maximization
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(41)- Drilling strategies for frontier areas
- An improved algorithm for solving biobjective integer programs
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration
- A fast interactive solution method for large capital expenditure selection problems
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- On efficient sets in vector maximum problems - A brief survey
- Cluster generation and grouping using mathematical programming
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
- Multicriteria dynamic programming with an application to the integer case
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Designing a quality control system in a service organization: A goal programming case study
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
- Algorithm robust for the bicriteria discrete optimization problem
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- An algorithm for the bi-criterion integer programming problem
- A review of interactive methods for multiobjective integer and mixed-integer programming
- An algorithm for the multiple objective integer linear programming problem
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Multiple criteria decision support -- a review
- A multi-objective constrained resource information system project selection method
- Network Models for Multiobjective Discrete Optimization
- 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
- Optimizing a linear function over an integer efficient set
- Zero-one programming with multiple criteria
- Algorithms for nonlinear integer bicriterion problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- A discussion of scalarization techniques for multiple objective integer programming
- A reference direction approach to multiple objective integer linear programming
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Solving zero-one multiple objective programs through implicit enumeration
- Multi-criteria integer linear fractional programming problem
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
This page was built for publication: Linear multiple objective programs with zero–one variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156137)