A mixed integer linear programming formulation of the maximum betweenness problem

DOI10.1016/j.ejor.2010.02.028zbMath1188.90186OpenAlexW2051624054MaRDI QIDQ976481

Marija Milanović, Aleksandar Savić, Jozef Kratica, Djordje Dugošija

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.028

zbMATH Keywords

linear programminginteger programmingbetweenness problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Related Items (1)

A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem

Uses Software

• CPLEX
• RHMAPPER

Cites Work

• Unnamed Item
• Unnamed Item
• A minmax regret approach to the critical path method with task interval times
• An MILP for scheduling problems in an FMS with one vehicle
• A flexible MILP model for multiple-shift workforce planning under annualized hours
• Optimization, approximation, and complexity classes
• Cyclic ordering is NP-complete
• A new approach to cyclic ordering of 2D orientations using ternary relation algebras
• On Random Betweenness Constraints
• Total Ordering Problem
• A Geometric Approach to Betweenness

This page was built for publication: A mixed integer linear programming formulation of the maximum betweenness problem