Result 1 to 20 of 79 total
A parallel Lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 237-248 (2012).
1
Optimization in designing complex communication networks. (English)
Thai, My T. (ed.) et al., Handbook of optimization in complex networks. Theory and applications. New York, NY: Springer (ISBN 978-1-4614-0753-9/hbk; 978-1-4614-0754-6/ebook). Springer Optimization and Its Applications 57, 3-37 (2012).
2
Relax-and-cut as a preprocessor and warm starter to branch-and-cut. (English)
Mahjoub, Ridha A. (ed.), Progress in combinatorial optimization. Selected papers based on the presentations at the international symposium (ISCO 2010), Hammamet, Tunisia, March 24‒26, 2010. London: ISTE; Hoboken, NJ: John Wiley \& Sons (ISBN 978-1-84821-206-0/hbk). 171-201 (2012).
3
Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks. (English)
Comput. Netw. 55, No. 13, 2803-2820 (2011).
4
A novel column generation algorithm for the vehicle routing problem with cross-docking. (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, 412-425 (2011).
5
The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm. (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, 162-169 (2011).
6
Formulations and branch-and-cut algorithm for the $K$-rooted mini-max spanning forest 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, 43-50 (2011).
7
Turing machines on Cayley graphs. (English)
Beklemishev, Lev D. (ed.) et al., Logic, language, information and computation. 18th international workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20919-2/pbk). Lecture Notes in Computer Science 6642. Lecture Notes in Artificial Intelligence, 84-94 (2011).
8
Heuristic and exact algorithms for a min-max selective vehicle routing problem. (English)
Comput. Oper. Res. 38, No. 7, 1054-1065 (2011).
9
A branch-and-price algorithm for a vehicle routing problem with cross-docking (English)
Electronic Notes in Discrete Mathematics 37, 249-254 (2011).
10
Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem (English)
Electronic Notes in Discrete Mathematics 37, 315-320 (2011).
11
Heuristic and exact algorithms for a min-Max selective vehicle routing problem (English)
Computers & OR 38, No. 7, 1054-1065 (2011).
12
Turing machines on Cayley graphs (English)
WoLLIC, 84-94 (2011).
13
Modeling and analyzing real-time embedded software for a data collection system (English)
ITNG, 731-736 (2011).
14
Effectively testing for a software product line with OTM3 organizational testing management maturity model (English)
ITNG, 274-279 (2011).
15
Problem based learning a practical approach for software engineering interdisciplinary teaching (English)
ITNG, 1046-1047 (2011).
16
Applying MDA approach to create graphical user interfaces (English)
ITNG, 766-771 (2011).
17
Formulations and branch-and-cut algorithm for the K-rooted mini-Max spanning forest problem (English)
INOC, 43-50 (2011).
18
A novel column generation algorithm for the vehicle routing problem with cross-docking (English)
INOC, 412-425 (2011).
19
The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm (English)
INOC, 162-169 (2011).
20
Result 1 to 20 of 79 total
Start
Contact
Print
General Help
