Result 1 to 20 of 2024 total
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. (English)
Discrete Appl. Math. 161, No. 1-2, 96-106 (2013).
1
On the independence number of the strong product of cycle-powers. (English)
Discrete Math. 313, No. 1, 105-110 (2013).
2
Advancing front circle packing to approximate conformal strips. (English)
Comput. Geom. 46, No. 1, 105-118 (2013).
3
A prototype column generation strategy for the multiple container loading problem. (English)
Eur. J. Oper. Res. 223, No. 1, 27-39 (2012).
4
Space defragmentation for packing problems. (English)
Eur. J. Oper. Res. 222, No. 3, 452-463 (2012).
5
A new iterative-doubling greedy-lookahead algorithm for the single container loading problem. (English)
Eur. J. Oper. Res. 222, No. 3, 408-417 (2012).
6
A constraint programming approach for a batch processing problem with non-identical job sizes. (English)
Eur. J. Oper. Res. 221, No. 3, 533-545 (2012).
7
A reference length approach for the 3D strip packing problem. (English)
Eur. J. Oper. Res. 220, No. 1, 37-47 (2012).
8
Graphs containing every 2-factor. (English)
Graphs Comb. 28, No. 5, 687-716 (2012).
9
Packing and covering triangles in $K_{4}$-free planar graphs. (English)
Graphs Comb. 28, No. 5, 653-662 (2012).
10
Design of computer experiments: space filling and beyond. (English)
Stat. Comput. 22, No. 3, 681-701 (2012).
11
When LP is the cure for your matching woes: improved bounds for stochastic matchings. (English)
Algorithmica 63, No. 4, 733-762 (2012).
12
Online set packing. (English)
SIAM J. Comput. 41, No. 4, 728-746 (2012).
13
A generalization of a theorem of Kleitman and Krieger. (English)
Int. J. Comput. Geom. Appl. 22, No. 2, 167-185 (2012).
14
Sparse graphs of girth at least five are packable. (English)
Discrete Math. 312, No. 24, 3606-3613 (2012).
15
Generalizations of the tree packing conjecture. (English)
Discuss. Math., Graph Theory 32, No. 3, 569-582 (2012).
16
Fractional distance domination in graphs. (English)
Discuss. Math., Graph Theory 32, No. 3, 449-459 (2012).
17
An efficient deterministic heuristic for two-dimensional rectangular packing. (English)
Comput. Oper. Res. 39, No. 7, 1355-1363 (2012).
18
Variable neighbourhood search for the variable sized bin packing problem. (English)
Comput. Oper. Res. 39, No. 5, 1097-1108 (2012).
19
Measuring instance difficulty for combinatorial optimization problems. (English)
Comput. Oper. Res. 39, No. 5, 875-889 (2012).
20
Result 1 to 20 of 2024 total
Start
Contact
Print
General Help
