팔로우
Michele Monaci
Michele Monaci
Professor of Operations Research, Università di Bologna
unibo.it의 이메일 확인됨
제목
인용
인용
연도
Two-dimensional packing problems: A survey
A Lodi, S Martello, M Monaci
European journal of operational research 141 (2), 241-252, 2002
12252002
Passenger railway optimization
A Caprara, L Kroon, M Monaci, M Peeters, P Toth, C Barnhart, G Laporte
Transportation, handbooks in operations research and management science 14 …, 2007
4272007
Light robustness
M Fischetti, M Monaci
Robust and online large-scale optimization, 61-84, 2009
3812009
An exact approach to the strip-packing problem
S Martello, M Monaci, D Vigo
INFORMS Journal on Computing 15 (3), 310-319, 2003
3812003
A Lagrangian heuristic algorithm for a real-world train timetabling problem
A Caprara, M Monaci, P Toth, PL Guida
Discrete applied mathematics 154 (5), 738-753, 2006
3012006
A new general-purpose algorithm for mixed-integer bilevel linear programs
M Fischetti, I Ljubić, M Monaci, M Sinnl
Operations Research 65 (6), 1615-1637, 2017
2112017
On the two-dimensional knapsack problem
A Caprara, M Monaci
Operations Research Letters 32 (1), 5-14, 2004
1832004
Integer linear programming models for 2-staged two-dimensional Knapsack problems
A Lodi, M Monaci
Mathematical Programming 94 (2), 257-278, 2003
1772003
An exact approach for the vertex coloring problem
E Malaguti, M Monaci, P Toth
Discrete Optimization 8 (2), 174-190, 2011
1682011
A metaheuristic approach for the vertex coloring problem
E Malaguti, M Monaci, P Toth
INFORMS Journal on Computing 20 (2), 302-316, 2008
1682008
On handling indicator constraints in mixed integer programming
P Belotti, P Bonami, M Fischetti, A Lodi, M Monaci, A Nogales-Gómez, ...
Computational Optimization and Applications 65, 545-566, 2016
1552016
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
M Battarra, M Monaci, D Vigo
Computers & Operations Research 36 (11), 3041-3050, 2009
1532009
Heuristic approaches for the fleet size and mix vehicle routing problem with Time Windows
M Dell'Amico, M Monaci, C Pagani, D Vigo
Transportation Science 41 (4), 516-526, 2007
1392007
Thinning out Steiner trees: a node-based model for uniform edge costs
M Fischetti, M Leitner, I Ljubić, M Luipersbeck, M Monaci, M Resch, ...
Mathematical Programming Computation 9 (2), 203-229, 2017
1332017
A set-covering-based heuristic approach for bin-packing problems
M Monaci, P Toth
INFORMS Journal on Computing 18 (1), 71-85, 2006
1242006
Exact solution techniques for two-dimensional cutting and packing
M Iori, VL De Lima, S Martello, FK Miyazawa, M Monaci
European Journal of Operational Research 289 (2), 399-415, 2021
1232021
Cutting plane versus compact formulations for uncertain (integer) linear programs
M Fischetti, M Monaci
Mathematical Programming Computation 4 (3), 239-273, 2012
1182012
Cutting plane versus compact formulations for uncertain (integer) linear programs
M Fischetti, M Monaci
Mathematical Programming Computation 4 (3), 239-273, 2012
1182012
Models and algorithms for a staff scheduling problem
A Caprara, M Monaci, P Toth
Mathematical Programming 98 (1-3), 445-476, 2003
1122003
Interdiction games and monotonicity, with application to knapsack problems
M Fischetti, I Ljubić, M Monaci, M Sinnl
INFORMS Journal on Computing 31 (2), 390-410, 2019
105*2019
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20