scientific article; zbMATH DE number 1423920
From MaRDI portal
Publication:4945108
DOI<57::AID-NAV4>3.0.CO;2-4 10.1002/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4zbMath0956.90041MaRDI QIDQ4945108
Margaret M. Wiecek, Kathrin Klamroth
Publication date: 23 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Multi-objective and goal programming (90C29) Dynamic programming (90C39)
Related Items (40)
Guided moth-flame optimiser for multi-objective optimization problems ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ Fuzzy approach to multilevel knapsack problems ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Network Models for Multiobjective Discrete Optimization ⋮ On a biobjective search problem in a line: formulations and algorithms ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ Ordinal optimization through multi-objective reformulation ⋮ Biobjective optimization problems on matroids with binary costs ⋮ Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ Connectedness of efficient solutions in multiple objective combinatorial optimization ⋮ The multiscenario lot size problem with concave costs. ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ A survey of recent developments in multiobjective optimization ⋮ Improved smoothed analysis of multiobjective optimization ⋮ Multiple criteria dynamic programming and multiple knapsack problem ⋮ Greedy algorithms for a class of knapsack problems with binary weights ⋮ Pareto optimal allocations and dynamic programming ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem ⋮ The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem ⋮ What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? ⋮ Implementing an efficient fptas for the 0-1 multi-objective knapsack problem ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ Punctuality and idleness in just-in-time scheduling ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ Heuristic allocation based on a dynamic programming state-space representation ⋮ Multiobjective solution of the uncapacitated plant location problem ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest paths in networks with vector weights
- An algorithm for the bi-criterion integer programming problem
- Multicriteria dynamic programming with an application to the integer case
- An algorithm for the multiple objective integer linear programming problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Relocation problems arising in conservation biology
- Dynamic programming in multiplicative lattices
- The Dynamic and Stochastic Knapsack Problem
- Vector-Valued Dynamic Programming
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Linear multiple objective programs with zero–one variables
- Multiobjective dynamic programming
- Parametric Solution for Linear Bicriteria Knapsack Models
This page was built for publication:
