Multi-objective binary search optimisation

DOI10.1007/3-540-36970-8_8MaRDI QIDQ4424287zbMATH OpenFDO

Authors Evan J. Hughes

Publication date 4 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2632/26320102.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Backtracking search algorithm for multi-objective design optimisation
• A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
• A multi-objective tabu search algorithm for constrained optimisation problems
• A deterministic algorithm for global multi-objective optimization
• On sampling methods for costly multi-objective black-box optimization

Cited in

(5)

• Multi-objective optimisation and decision-making of space station logistics strategies
• On sampling methods for costly multi-objective black-box optimization
• Proposal and validation of an optimization method using Monte Carlo method for multi-objective functions
• Backtracking search algorithm for multi-objective design optimisation
• The problem of premature convergence in engineering optimization problems

This page was built for publication: Multi-objective binary search optimisation

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