scientific article; zbMATH DE number 915988

Publication date: 6 January 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

multi-objective combinatorial optimization bicriteria case efficient non-supported solutions efficient supported solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ Dominance for multi-objective robust optimization concepts ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems ⋮ A bi-criteria approach for the data association problem ⋮ Multi-criteria assignment problem with incompatibility and capacity constraints ⋮ On the representation of the search region in multi-objective optimization ⋮ A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives ⋮ A biobjective method for sample allocation in stratified sampling ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ A population-based algorithm for solving linear assignment problems with two objectives ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis) ⋮ A hybrid approach for biobjective optimization ⋮ Parallel partitioning method (PPM): A new exact method to solve bi-objective problems ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Bound sets for biobjective combinatorial optimization problems ⋮ An exact algorithm for biobjective integer programming problems ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ A mathematical programming approach to the computation of the omega invariant of a numerical semigroup ⋮ A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ Multiobjective blockmodeling for social network analysis ⋮ A biobjective optimization model for deadline satisfaction in line-of-balance scheduling with work interruptions consideration ⋮ A hybrid method for solving the multi-objective assignment problem ⋮ A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ Primal-dual simplex method for multiobjective linear programming ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ Bi-objective matchings with the triangle inequality ⋮ Efficient computation of the search region in multi-objective optimization ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ A new complexity result on multiobjective linear integer programming using short rational generating functions ⋮ Multi-objective vehicle routing problems ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions ⋮ Nature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ Unnamed Item ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach