Analysis of LP relaxations for multiway and multicut problems
Networks
Saved in:
Main Authors: | Bertsimas, D., Teo, C.-P., Vohra, R. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44907 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The parsimonious property of cut covering problems and its applications
by: Bertsimas, D., et al.
Published: (2013) -
The classification problem for nonatomic weak Lp spaces
by: Leung, D.H., et al.
Published: (2014) -
Improved Parallel Approximation of a Class of Integer Programming Problems
by: Alon, N., et al.
Published: (2014) -
A multicut outer-approximation approach for competitive facility location under random utilities
by: MAI, Tien, et al.
Published: (2020) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014)