scientific article; zbMATH DE number 1423920

From MaRDI portal
Revision as of 08:02, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4945108

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4" /><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.



Related Items (40)

Guided moth-flame optimiser for multi-objective optimization problemsDynamic programming algorithms for the bi-objective integer knapsack problemSolving the linear multiple choice knapsack problem with two objectives: Profit and equitySolution approaches for equitable multiobjective integer programming problemsA trade-off multiobjective dynamic programming procedure and its application to project portfolio selectionCombination of MCDM and covering techniques in a hierarchical model for facility location: a case studyFuzzy approach to multilevel knapsack problemsCompressed data structures for bi-objective \(\{0,1\}\)-knapsack problemsAn augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problemsAlgorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problemNetwork Models for Multiobjective Discrete OptimizationOn a biobjective search problem in a line: formulations and algorithmsThe smoothed number of Pareto-optimal solutions in bicriteria integer optimizationOrdinal optimization through multi-objective reformulationBiobjective optimization problems on matroids with binary costsDynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problemSolving 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 problemsConnectedness of efficient solutions in multiple objective combinatorial optimizationThe multiscenario lot size problem with concave costs.The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria OptimizationA two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problemSolving efficiently the 0-1 multi-objective knapsack problemA survey of recent developments in multiobjective optimizationImproved smoothed analysis of multiobjective optimizationMultiple criteria dynamic programming and multiple knapsack problemGreedy algorithms for a class of knapsack problems with binary weightsPareto optimal allocations and dynamic programmingAn improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problemsAnalysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problemThe small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problemWhat foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods?Implementing an efficient fptas for the 0-1 multi-objective knapsack problemLabeling algorithms for multiple objective integer knapsack problemsSolving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithmsPunctuality and idleness in just-in-time schedulingThe multiobjective multidimensional knapsack problem: a survey and a new approachHeuristic allocation based on a dynamic programming state-space representationMultiobjective solution of the uncapacitated plant location problemA reduction dynamic programming algorithm for the bi-objective integer knapsack problem


Uses Software



Cites Work




This page was built for publication: