The parsimonious property of cut covering problems and its applications
Operations Research Letters
Saved in:
Main Authors: | Bertsimas, D., Teo, C. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44971 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Analysis of LP relaxations for multiway and multicut problems
by: Bertsimas, D., et al.
Published: (2013) -
On parsimony and clustering
by: Oggier, Frederique, et al.
Published: (2023) -
Reconstructing recombination network from sequence data: The small parsimony problem
by: Nguyen, C.T., et al.
Published: (2013) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014)