Zero-one programming with multiple criteria

DOI10.1016/0377-2217(86)90161-XzbMath0594.90058OpenAlexW2060499510MaRDI QIDQ1077328

L. M. Rasmussen

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90161-x

zbMATH Keywords

multiple criteria programming0-1 multiple criteria problems

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)

Related Items (23)

General communication schemes for multiobjective decision making ⋮ Zero-one programming with multiple criteria ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ AXIS: A framework for interactively combining structured algorithms and knowledge based systems ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An interactive algorithm for solving multiple objective integer linear programming problems ⋮ Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization ⋮ 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 ⋮ 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 ⋮ A reference direction approach to multiple objective integer linear programming ⋮ The multiscenario lot size problem with concave costs. ⋮ Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming ⋮ 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 ⋮ A multicriteria decision-making approach to university resource allocations and information infrastructure planning ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming ⋮ Multiobjective solution of the uncapacitated plant location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound method for multi-objective Boolean problems
• An enhanced conversion scheme for lexicographic, multiobjective integer programs
• A multiple objective interactive Lagrangean relaxation approach
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Zero-one programming with multiple criteria
• A multicriteria approach to the location of public facilities
• Reducibility of minimax to minisum 0-1 programming problems
• A multiple criteria method for choosing among discrete alternatives
• An algorithm for the multiple objective integer linear programming problem
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• An approach to the modeling and analysis of multiobjective generalized networks
• The design of multiactivity multifacility systems
• Solving zero-one multiple objective programs through implicit enumeration
• Proper efficiency and the theory of vector maximization
• Solving the Discrete Multiple Criteria Problem using Convex Cones
• An Algorithm for Multiobjective Zero-One Linear Programming
• Parametric Multicriteria Integer Programming
• An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
• 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
• Linear multiple objective programs with zero–one variables
• An interactive weighted Tchebycheff procedure for multiple objective programming

This page was built for publication: Zero-one programming with multiple criteria