The linear ordering problem with cumulative costs
From MaRDI portal
Publication:2482806
DOI10.1016/j.ejor.2006.03.071zbMath1146.90497OpenAlexW2063980384MaRDI QIDQ2482806
Matteo Fischetti, Livio Bertacco, Lorenzo Brunetta
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.071
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
Evaluating topological ordering in directed acyclic graphs ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem ⋮ A polynomially solvable case of optimal linear extension problem of a poset ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ A semidefinite optimization approach to the target visitation problem ⋮ A branch-and-bound algorithm for the linear ordering problem with cumulative costs ⋮ A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An effective memetic algorithm for the cumulative capacitated vehicle routing problem ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem
Uses Software
Cites Work
This page was built for publication: The linear ordering problem with cumulative costs
