A Revisited Branch and Bound Method for the Weighted Safe Set Problem

Alberto Boggio Tomasaz; Roberto Cordone

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

A Revisited Branch and Bound Method for the Weighted Safe Set Problem

Topics: Linear Programming; Network Optimization; Optimization; OR in Emergency Management; Resource Allocation; Risk Management

In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems ICORES - Volume 1, 113-122, 2024 , Rome, Italy

Authors: Alberto Boggio Tomasaz and Roberto Cordone

Affiliation: Department of Computer Science, University of Milan, Italy

Keyword(s): Weighted Safe Set Problem, Branch and Bound.

Abstract: The Weighted Safe Set Problem requires to partition an undirected graph into two families of connected components, respectively denoted as safe and unsafe, in such a way that each safe component dominates the unsafe adjacent components with respect to a weight function. We introduce some improvements to an existing exact approach that produce a significant reduction in the effort required to find the optimum or in the gap between the optimum and the best solution obtained within a given time limit. The first improvement consists of a relaxation that is weaker than the original one, but allows to adopt a more effective branching strategy and stronger variable fixing procedures. The second one is the integration of a dedicated heuristic in the exact approach. The experimental results show a strong average reduction of the computational time and the number of branching nodes. This also mitigates the anticipated termination of the algorithm due to the exhaustion of the memory on the larg est benchmark instances. (More)

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.136.236.119

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Boggio Tomasaz, A. and Cordone, R. (2024). A Revisited Branch and Bound Method for the Weighted Safe Set Problem. In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-681-1; ISSN 2184-4372, SciTePress, pages 113-122. DOI: 10.5220/0012359400003639

@conference{icores24,
author={Alberto {Boggio Tomasaz}. and Roberto Cordone.},
title={A Revisited Branch and Bound Method for the Weighted Safe Set Problem},
booktitle={Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2024},
pages={113-122},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012359400003639},
isbn={978-989-758-681-1},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES
TI - A Revisited Branch and Bound Method for the Weighted Safe Set Problem
SN - 978-989-758-681-1
IS - 2184-4372
AU - Boggio Tomasaz, A.
AU - Cordone, R.
PY - 2024
SP - 113
EP - 122
DO - 10.5220/0012359400003639
PB - SciTePress