Result 1 to 20 of 106 total
Solving large $p$-median problems with a radius formulation. (English)
INFORMS J. Comput. 23, No. 4, 546-556 (2011).
1
Valid inequalities and branch-and-cut for the clique pricing problem. (English)
Discrete Optim. 8, No. 3, 393-410 (2011).
2
Generalized network design polyhedra. (English)
Networks 58, No. 2, 125-136 (2011).
3
Scheduling two chains of unit jobs on one machine: a polyhedral study. (English)
Networks 58, No. 2, 103-113 (2011).
4
Improved formulations for the ring spur assignment problem. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 24-36 (2011).
5
Reduction approaches for robust shortest path problems. (English)
Comput. Oper. Res. 38, No. 11, 1610-1619 (2011).
6
An exact approach to the problem of extracting an embedded network matrix. (English)
Comput. Oper. Res. 38, No. 11, 1483-1492 (2011).
7
A branch-and-cut algorithm for the partitioning-hub location-routing problem. (English)
Comput. Oper. Res. 38, No. 2, 539-549 (2011).
8
A branch-and-cut algorithm for the partitioning-hub location-routing problem (English)
Computers & OR 38, No. 2, 539-549 (2011).
9
An exact approach to the problem of extracting an embedded network matrix (English)
Computers & OR 38, No. 11, 1483-1492 (2011).
10
Reduction approaches for robust shortest path problems (English)
Computers & OR 38, No. 11, 1610-1619 (2011).
11
Improved formulations for the ring spur assignment problem (English)
INOC, 24-36 (2011).
12
Memory management for real-time appearance-based loop closure detection (English)
IROS, 1271-1276 (2011).
13
A class representative model for pure parsimony haplotyping. (English)
INFORMS J. Comput. 22, No. 2, 195-209 (2010).
14
A polyhedral study of the network pricing problem with connected toll arcs. (English)
Networks 55, No. 3, 234-246 (2010).
15
Size-constrained graph partitioning polytopes. (English)
Discrete Math. 310, No. 24, 3473-3493 (2010).
16
Generating facets for the independence system polytope. (English)
SIAM J. Discrete Math. 23, No. 3, 1484-1506 (2009).
17
Pricing geometric transportation networks. (English)
Int. J. Comput. Geom. Appl. 19, No. 6, 507-520 (2009).
18
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. (English)
Networks 53, No. 2, 126-140 (2009).
19
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. (English)
Discrete Optim. 6, No. 2, 135-147 (2009).
20
Result 1 to 20 of 106 total
Start
Contact
Print
General Help
