Journal of combinatorial optimization
container_tsm6lnbvf5ahzjp7czojbjig5i
Springer-Verlag
Showing first 25 out of 2,425 results
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
E. de Klerk, D.V. Pasechnik, J.P. Warners
2004
|
Journal of combinatorial optimization
doi:10.1023/b:joco.0000038911.67280.3f
Capacity inverse minimum cost flow problem
Çiğdem Güler, Horst W. Hamacher
2008
|
Journal of combinatorial optimization
doi:10.1007/s10878-008-9159-8
Influencing factors analysis and modeling of hospital-acquired infection in elderly patients
Xiaohui Liu, Ni Zou, Dan Zhu, Dan Wang
2018
|
Journal of combinatorial optimization
doi:10.1007/s10878-017-0222-1
Algorithm for the Cost Edge-Coloring of Trees
Xiao Zhou, Takao Nishizeki
2004
|
Journal of combinatorial optimization
doi:10.1023/b:joco.0000021940.40066.0c
Online bottleneck matching
Barbara M. Anthony, Christine Chung
2012
|
Journal of combinatorial optimization
doi:10.1007/s10878-012-9581-9
Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design
H. K. Fung, S. Rao, C. A. Floudas, O. Prokopyev, P. M. Pardalos, F. Rendl
2005
|
Journal of combinatorial optimization
doi:10.1007/s10878-005-1859-8
The extremal spectral radii of $$k$$ k -uniform supertrees
Honghai Li, Jia-Yu Shao, Liqun Qi
2015
|
Journal of combinatorial optimization
doi:10.1007/s10878-015-9896-4
Random Pooling Designs Under Various Structures
F.K. Hwang, Y.C. Liu
2003
|
Journal of combinatorial optimization
doi:10.1023/b:joco.0000017382.83399.0b
A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints
Hung Q. Ngo, Anh Le, Yang Wang
2009
|
Journal of combinatorial optimization
doi:10.1007/s10878-009-9240-y
Directed Steiner trees with diffusion costs
Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth
2015
|
Journal of combinatorial optimization
doi:10.1007/s10878-015-9925-3
On minimum m-connected k-dominating set problem in unit disc graphs
Weiping Shang, Frances Yao, Pengjun Wan, Xiaodong Hu
2007
|
Journal of combinatorial optimization
doi:10.1007/s10878-007-9124-y
Modeling and in vitro and in vivo characterization of a tissue engineered pancreatic substitute
C. L. Stabler, C. Fraker, E. Pedraza, I. Constantinidis, A. Sambanis
2008
|
Journal of combinatorial optimization
doi:10.1007/s10878-008-9183-8
Editorial, COCOON 2007 special issue
Guohui Lin, Zhipeng Cai
2008
|
Journal of combinatorial optimization
doi:10.1007/s10878-008-9167-8
:{unav)
Philippe Galinier, Jin-Kao Hao
2012
|
Journal of combinatorial optimization
doi:10.1023/a:1009823419804
Weighted amplifiers and inapproximability results for Travelling Salesman problem
Miroslav Chlebík, Janka Chlebíková
2020
|
Journal of combinatorial optimization
doi:10.1007/s10878-020-00659-0
Efficient algorithms for supergraph query processing on graph databases
Shuo Zhang, Xiaofeng Gao, Weili Wu, Jianzhong Li, Hong Gao
2009
|
Journal of combinatorial optimization
doi:10.1007/s10878-009-9221-1
The traveling salesman problem on grids with forbidden neighborhoods
Anja Fischer, Philipp Hungerländer
2017
|
Journal of combinatorial optimization
doi:10.1007/s10878-017-0119-z
Why locally-fair maximal flows in client-server networks perform well
Kenneth A. Berman, Chad Yoshikawa
2010
|
Journal of combinatorial optimization
doi:10.1007/s10878-010-9321-y
The cost of selfishness for maximizing the minimum load on uniformly related machines
Leah Epstein, Elena Kleiman, Rob van Stee
2012
|
Journal of combinatorial optimization
doi:10.1007/s10878-012-9555-y
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor
Zhixiang Chen, Bin Fu, John Abraham
2008
|
Journal of combinatorial optimization
doi:10.1007/s10878-008-9169-6
A parameterized perspective on packing paths of length two
Henning Fernau, Daniel Raible
2009
|
Journal of combinatorial optimization
doi:10.1007/s10878-009-9230-0
On the computational hardness based on linear FPT-reductions
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2006
|
Journal of combinatorial optimization
doi:10.1007/s10878-006-7137-6
An optimal online algorithm for single machine scheduling to minimize total general completion time
Ming Liu, Chengbin Chu, Yinfeng Xu, Jiazhen Huo
2010
|
Journal of combinatorial optimization
doi:10.1007/s10878-010-9348-0
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han
2012
|
Journal of combinatorial optimization
doi:10.1007/s10878-012-9457-z
Recoverable robust spanning tree problem under interval uncertainty representations
Mikita Hradovich, Adam Kasperski, Paweł Zieliński
2016
|
Journal of combinatorial optimization
doi:10.1007/s10878-016-0089-6
« Previous
Showing results 0 — 25 out of 2,425 results
Next »