An exact criterion space search method for a bi-objective nursing home location and allocation problem

DOI10.1016/j.matcom.2022.11.011OpenAlexW4309567807MaRDI QIDQ6102633

Rashed. Sahraeian, Masoud Atashpaz Gargari

Publication date: 23 June 2023

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2022.11.011

zbMATH Keywords

bi-objective optimizationcriterion space search algorithmlocation and allocationminimum feasible rectanglenursing home system

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Multi-criteria location planning for public facilities in tsunami-prone coastal areas
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• A survey of healthcare facility location
• Multi-objective branch and bound
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning
• Two-tier search space optimisation technique for tuning of explicit plant-model mismatch in model predictive controller for industrial cement kiln process
• Finding representative systems for discrete bicriterion optimization problems
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method

This page was built for publication: An exact criterion space search method for a bi-objective nursing home location and allocation problem