Approximating the Pareto frontier for a challenging real-world bi-objective covering problem

DOI10.1080/03155986.2022.2040274OpenAlexW4226385637MaRDI QIDQ5883604FDOQ5883604

Authors: Nils-Hassan Quttineh, Uledi Ngulo, Torbjörn Larsson 

Publication date: 21 March 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.2022.2040274

Recommendations

• An algorithm for approximating the Pareto set of the multiobjective set covering problem
• A tolerance function for the multiobjective set covering problem
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
• The bi-objective covering tour problem
• Variable and large neighborhood search to solve the multiobjective set covering problem

zbMATH Keywords

heuristicmulti-objective optimizationset covering problemdiscrete optimizationLagrangian duality

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
• Title not available (Why is that?)
• A Heuristic Method for the Set Covering Problem
• Title not available (Why is that?)
• A genetic-based framework for solving (multi-criteria) weighted matching problems.

Cited In (1)

• An algorithm for approximating the Pareto set of the multiobjective set covering problem

This page was built for publication: Approximating the Pareto frontier for a challenging real-world bi-objective covering problem

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