Search space analysis of the linear ordering problem

DOI10.1007/3-540-36605-9_30MaRDI QIDQ4418392zbMATH OpenFDO

Authors Tommaso Schiavinotto, Thomas Stützle

Publication date 10 August 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/2611/26110322.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The linear ordering problem: instances, search space analysis and algorithms
• The linear ordering problem revisited
• Revised GRASP with path-relinking for the linear ordering problem
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Block-insertion-based algorithms for the linear ordering problem

Cited in

(10)

• The linear ordering problem: instances, search space analysis and algorithms
• A new heuristic algorithm solving the linear ordering problem
• Block-insertion-based algorithms for the linear ordering problem
• The linear ordering problem revisited
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Designing a hybrid genetic algorithm for the linear ordering problem
• Performance of linear-space search algorithms
• Linearizing partial search orders
• Linear-space best-first search
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

Describes a project that uses

Uses Software

• LOLIB
• GraphBase

This page was built for publication: Search space analysis of the linear ordering problem

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