A two-stage approach for bi-objective integer linear programming

DOI10.1016/j.orl.2017.11.011OpenAlexW2773403557MaRDI QIDQ2417052

Hadi Charkhgard, Rui Dai

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.11.011

zbMATH Keywords

\(\epsilon\)-constraint methodtwo-stage approachbi-objective integer linear programmingbalanced box method

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ An exact algorithm for biobjective integer programming problems ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests

Cites Work

• Unnamed Item
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• An algorithm for the bi-criterion integer programming problem
• An improved algorithm for solving biobjective integer programs
• 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: A two-stage approach for bi-objective integer linear programming