scientific article; zbMATH DE number 1488081
From MaRDI portal
Publication:4495184
zbMath0970.90068MaRDI QIDQ4495184
Fouad Ben Abdelaziz, Jouhaina Siala Chaouachi, Saoussen Krichen
Publication date: 10 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Multi-objective and goal programming (90C29) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (16)
Bi-objective optimization of retailer's profit and customer surplus in assortment and pricing planning ⋮ Guided moth-flame optimiser for multi-objective optimization problems ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Multi-objectives tabu search based algorithm for progressive resource allocation ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ Store-wide space planning balancing Impulse and convenience ⋮ A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the 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 ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
This page was built for publication:
