On beam search for multicriteria combinatorial optimization problems

DOI10.1007/978-3-642-29828-8_20MaRDI QIDQ2902929zbMATH OpenOpenAlexFDO

Authors Aníbal Ponte, Luís Paquete, José Rui Figueira

Publication date 22 August 2012

Published in Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29828-8_20

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 2159093
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• Job shop scheduling with beam search
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems

Cited in

(7)

• scientific article; zbMATH DE number 2159093 (Why is no real title available?)
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• scientific article; zbMATH DE number 956508 (Why is no real title available?)
• Representation of the non-dominated set in biobjective discrete optimization
• A note on the \(\epsilon\)-indicator subset selection
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems

Describes a project that uses

Uses Software

• SMS-EMOA

This page was built for publication: On beam search for multicriteria combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902929)