Result 1 to 20 of 36 total
New constructive algorithms for leather nesting in the automotive industry. (English)
Comput. Oper. Res. 39, No. 7, 1487-1505 (2012).
1
On the extremality of maximal dual feasible functions. (English)
Oper. Res. Lett. 40, No. 1, 25-30 (2012).
2
New constructive algorithms for leather nesting in the automotive industry (English)
Computers & OR 39, No. 7, 1487-1505 (2012).
3
New stabilization procedures for the cutting stock problem. (English)
INFORMS J. Comput. 23, No. 4, 530-545 (2011).
4
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. (English)
Eur. J. Oper. Res. 214, No. 3, 536-545 (2011).
5
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines. (English)
Int. J. Manuf. Technol. Manag. 22, No. 1, 39-57 (2011).
6
Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems. (English)
Asia-Pac. J. Oper. Res. 28, No. 2, 255-278 (2011).
7
An integer programming model for the minimum interval graph completion problem. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 583-590 (2010).
8
Minimization of open orders using interval graphs. (English)
IAENG, Int. J. Appl. Math. 40, No. 4, 297-306 (2010).
9
A survey of dual-feasible and superadditive functions. (English)
Ann. Oper. Res. 179, 317-342 (2010).
10
An integer programming model for two- and three-stage two-dimensional cutting stock problems. (English)
Eur. J. Oper. Res. 205, No. 3, 699-708 (2010).
11
Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. (English)
Optim. Methods Softw. 25, No. 2, 299-319 (2010).
12
Arc-flow model for the two-dimensional guillotine cutting stock problem. (English)
Comput. Oper. Res. 37, No. 6, 991-1001 (2010).
13
An integer programming model for the minimum interval graph completion problem (English)
Electronic Notes in Discrete Mathematics 36, 583-590 (2010).
14
Arc-flow model for the two-dimensional guillotine cutting stock problem (English)
Computers & OR 37, No. 6, 991-1001 (2010).
15
New lower bounds based on column generation and constraint programming for the pattern minimization problem. (English)
Comput. Oper. Res. 36, No. 11, 2944-2954 (2009).
16
New lower bounds based on column generation and constraint programming for the pattern minimization problem (English)
Computers & OR 36, No. 11, 2944-2954 (2009).
17
Exact algorithms for vehicle routing problems with different service constraints (English)
CTW, 215-218 (2009).
18
A branch-and-price-and-cut algorithm for the pattern minimization problem. (English)
RAIRO, Oper. Res. 42, No. 4, 435-453 (2008).
19
New integer programming formulations and an exact algorithm for the ordered cutting stock problem. (English)
J. Oper. Res. Soc. 59, No. 11, 1520-1531 (2008).
20
Result 1 to 20 of 36 total