The following pages link to Darko Skorin-Kapov (Q1278344):
Displaying 15 items.
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← links)
- On tabu search for the location of interacting hub facilities (Q1328642) (← links)
- On cost allocation in hub-like networks (Q1599299) (← links)
- Network cost minimization using threshold-based discounting (Q1600844) (← links)
- Social enterprise tree network games (Q1622035) (← links)
- Threshold based discounting networks: the cost allocation provided by the nucleolus (Q1779541) (← links)
- On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
- On Cost Allocation in Networks with Threshold Based Discounting (Q2744731) (← links)
- (Q2768210) (← links)
- A note on Steiner tree games (Q2892158) (← links)
- (Q2966401) (← links)
- NC Algorithms for Recognizing Partial 2-Trees and 3-Trees (Q3358764) (← links)
- Lower Bounds for the Hub Location Problem (Q4859339) (← links)
