Outer Branching: How to Optimize under Partial Orders?

DOI10.1007/978-3-540-85646-7_10zbMath1176.90520OpenAlexW2174882474WikidataQ62043287 ScholiaQ62043287MaRDI QIDQ3649598

Ulrich Junker

Publication date: 4 December 2009

Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_10

zbMATH Keywords

constraint programmingPareto optimizationpreference handling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

MiniBrass: soft constraints for MiniZinc

Cites Work

• Unnamed Item
• Unnamed Item
• Improved \(\varepsilon\)-constraint method for multiobjective programming
• Solving a bicriterion scheduling problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Preference-based search and multi-criteria optimization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems

This page was built for publication: Outer Branching: How to Optimize under Partial Orders?