Pages that link to "Item:Q976481"
From MaRDI portal
The following pages link to A mixed integer linear programming formulation of the maximum betweenness problem (Q976481):
Displaying 6 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
- A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem (Q5279220) (← links)
- BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES (Q5694062) (← links)