A mixed integer linear programming formulation of the maximum betweenness problem
From MaRDI portal
Publication:976481
DOI10.1016/J.EJOR.2010.02.028zbMATH Open1188.90186OpenAlexW2051624054MaRDI QIDQ976481FDOQ976481
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
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
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Total Ordering Problem
- An MILP for scheduling problems in an FMS with one vehicle
- Cyclic ordering is NP-complete
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras
- On Random Betweenness Constraints
- A Geometric Approach to Betweenness
- A minmax regret approach to the critical path method with task interval times
- A flexible MILP model for multiple-shift workforce planning under annualized hours
- Title not available (Why is that?)
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
Uses Software
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)
