Compact MILP formulations for the p-center problem

DOI10.1007/978-3-319-96151-4_2MaRDI QIDQ1661850zbMATH OpenOpenAlexFDO

Authors Zacharie Ales, Sourour Elloumi

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_2

zbMATH Keywords

integer programming\(p\)-centerdiscrete locationequivalent formulations

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• A new formulation and resolution method for the \(p\)-center problem
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
• A tighter formulation of the \(p\)-median problem
• A computational study for the \(p\)-median problem
• scientific article; zbMATH DE number 849074

Cited in

(9)

• MILP-Formulations for the Total Adjustment Cost Problem
• Compact MILP formulations for the $p$-center problem
• Exact solution approaches for the discrete α‐neighbor p‐center problem
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
• A new formulation and resolution method for the \(p\)-center problem
• A tighter formulation of the \(p\)-median problem
• New formulations for two location problems with interconnected facilities
• Double bound method for solving the \(p\)-center location problem
• Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Compact MILP formulations for the \(p\)-center problem

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