default search action
Journal of Combinatorial Optimization, Volume 17
Volume 17, Number 1, January 2009
- Onur Seref, Petros Xanthopoulos:
Guest Editorial. 1-2 - Onur Seref, O. Erhun Kundakcioglu, Oleg A. Prokopyev, Panos M. Pardalos:
Selective support vector machines. 3-20 - Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Jinhui Xu, Michael J. Zeitz, Ronald Berezney:
Generalized median graphs and applications. 21-44 - My T. Thai, Taieb Znati:
On the complexity and approximation of non-unique probe selection using d -disjunct matrix. 45-53 - C. L. Stabler, Christopher Fraker, E. Pedraza, I. Constantinidis, A. Sambanis:
Modeling and in vitro and in vivo characterization of a tissue engineered pancreatic substitute. 54-73 - Shivkumar Sabesan, Niranjan Chakravarthy, Kostas Tsakalis, Panos M. Pardalos, Leonidas D. Iasemidis:
Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques. 74-97 - Niranjan Chakravarthy, Shivkumar Sabesan, Kostas Tsakalis, Leonidas D. Iasemidis:
Controlling epileptic seizures in a neural mass model. 98-116
Volume 17, Number 2, February 2009
- Imed Kacem:
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. 117-133 - Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos:
Multiple phase neighborhood Search - GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP. 134-156 - Dominique Quadri, Éric Soutif, Pierre Tolla:
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. 157-167 - Mathieu Bouchard, Alain Hertz, Guy Desaulniers:
Lower bounds and a tabu search algorithm for the minimum deficiency problem. 168-191 - Natalia Vanetik:
Path packing and a related optimization problem. 192-205 - Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu:
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. 206-213 - Saman Eskandarzadeh, Reza Tavakkoli-Moghaddam, Amir Azaron:
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems. 214-234
Volume 17, Number 3, April 2009
- Peng Xiao, Yinfeng Xu, Bing Su:
Finding an anti-risk path between two nodes in undirected graphs. 235-246 - Jianping Wang, Jing Chen, Mei Yang, S. Q. Zheng:
Traffic regulation with single- and dual-homed ISPs under a percentile-based pricing policy. 247-273 - Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs. 274-311 - Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. 312-322 - Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer:
Single machine batch scheduling with release times. 323-338 - Xinlu Zhang, Jun Guo, Suogang Gao:
Two new error-correcting pooling designs from d -bounded distance-regular graphs. 339-345
Volume 17, Number 4, May 2009
- Zhenbo Wang, Wenxun Xing:
A successive approximation algorithm for the multiple knapsack problem. 347-366 - Huaming Zhang, Xin He:
Optimal st -orientations for plane triangulations. 367-377 - Boting Yang, Yi Cao:
Standard directed search strategies and their applications. 378-399 - Subhash C. Sarin, Balaji Nagarajan, Sanjay Jain, Lingrui Liao:
Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability. 400-416 - Deshi Ye, Xin Han, Guochuan Zhang:
A note on online strip packing. 417-423 - Guang Xu, Jinhui Xu:
An improved approximation algorithm for uncapacitated facility location problem with penalties. 424-436
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.