A mixed integer linear programming formulation of the maximum betweenness problem

DOI10.1016/J.EJOR.2010.02.028MaRDI QIDQ976481zbMATH OpenOpenAlexFDO

Authors Aleksandar Savić, Jozef Kratica, Marija Milanović, đorđe 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

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

Recommendations

• A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem
• Stronger formulations of mixed integer linear programs: an example
• scientific article; zbMATH DE number 2125698
• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
• Optimal linear arrangements using betweenness variables

Cites work

• scientific article; zbMATH DE number 5666448 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Geometric Approach to Betweenness
• A flexible MILP model for multiple-shift workforce planning under annualized hours
• A minmax regret approach to the critical path method with task interval times
• A new approach to cyclic ordering of 2D orientations using ternary relation algebras
• An MILP for scheduling problems in an FMS with one vehicle
• Cyclic ordering is NP-complete
• On Random Betweenness Constraints
• Optimization, approximation, and complexity classes
• Total Ordering Problem

Cited in

(5)

• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
• A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem
• On the maximum betweenness improvement problem
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem

Describes a project that uses

Uses Software

• RHMAPPER
• CPLEX

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

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