Michele Monaci

	2012
31		Mohammad Dolatabadi, Andrea Lodi, Michele Monaci: Exact algorithms for the two-dimensional guillotine knapsack. Computers & OR 39(1): 48-53 (2012)
30		Matteo Fischetti, Michele Monaci: Branching on nonchimerical fractionalities. Oper. Res. Lett. 40(3): 159-164 (2012)
29		Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger: Complexity and approximation of an area packing problem. Optimization Letters 6(1): 1-9 (2012)
	2011
28		Michele Monaci, Ulrich Pferschy: On the Robust Knapsack Problem. CTW 2011: 207-210
27		Matteo Fischetti, Michele Monaci: Backdoor Branching. IPCO 2011: 183-191
26		Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci: A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. Computer Networks 55(16): 3680-3693 (2011)
25		Enrico Malaguti, Michele Monaci, Paolo Toth: An exact approach for the Vertex Coloring Problem. Discrete Optimization 8(2): 174-190 (2011)
	2010
24		Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci: Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. INFOCOM 2010: 2160-2168
23		Alberto Caprara, Andrea Lodi, Michele Monaci: An approximation scheme for the two-stage, two-dimensional knapsack problem. Discrete Optimization 7(3): 114-124 (2010)
	2009
22		Matteo Fischetti, Michele Monaci: Light Robustness. Robust and Online Large-Scale Optimization 2009: 61-84
21		Maria Battarra, Michele Monaci, Daniele Vigo: An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Computers & OR 36(11): 3041-3050 (2009)
20		Enrico Malaguti, Michele Monaci, Paolo Toth: Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15(5): 503-526 (2009)
19		Alberto Caprara, Michele Monaci: Bidimensional packing by bilinear programming. Math. Program. 118(1): 75-108 (2009)
	2008
18		Matteo Fischetti, Michele Monaci: How tight is the corner relaxation? Discrete Optimization 5(2): 262-269 (2008)
17		Enrico Malaguti, Michele Monaci, Paolo Toth: A Metaheuristic Approach for the Vertex Coloring Problem. INFORMS Journal on Computing 20(2): 302-316 (2008)
16		Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci: Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. INFORMS Journal on Computing 20(3): 333-344 (2008)
	2007
15		Mauro Dell'Amico, Michele Monaci, Corrado Pagani, Daniele Vigo: Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transportation Science 41(4): 516-526 (2007)
	2006
14		Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida: A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 154(5): 738-753 (2006)
13		Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci: Packing into the smallest square: Worst-case analysis of lower bounds. Discrete Optimization 3(4): 317-326 (2006)
12		Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci: Lower bounds and heuristic algorithms for the k. European Journal of Operational Research 171(3): 725-742 (2006)
11		Michele Monaci, Paolo Toth: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. INFORMS Journal on Computing 18(1): 71-85 (2006)
	2005
10		Alberto Caprara, Marco Locatelli, Michele Monaci: Bidimensional Packing by Bilinear Programming. IPCO 2005: 377-391
9		Alberto Caprara, Andrea Lodi, Michele Monaci: Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005)
	2004
8		Alberto Caprara, Michele Monaci: On the two-dimensional Knapsack Problem. Oper. Res. Lett. 32(1): 5-14 (2004)
	2003
7		Michele Monaci: Algorithms for packing and scheduling problems. 4OR 1(1): 85-87 (2003)
6		Silvano Martello, Michele Monaci, Daniele Vigo: An Exact Approach to the Strip-Packing Problem. INFORMS Journal on Computing 15(3): 310-319 (2003)
5		Andrea Lodi, Michele Monaci: Integer linear programming models for 2-staged two-dimensional Knapsack problems. Math. Program. 94(2-3): 257-278 (2003)
4		Alberto Caprara, Michele Monaci, Paolo Toth: Models and algorithms for a staff scheduling problem. Math. Program. 98(1-3): 445-476 (2003)
	2002
3		Alberto Caprara, Andrea Lodi, Michele Monaci: An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328
2		Andrea Lodi, Silvano Martello, Michele Monaci: Two-dimensional packing problems: A survey. European Journal of Operational Research 141(2): 241-252 (2002)
	2001
1		Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth: Solution of Real-World Train Timetabling Problems. HICSS 2001

Coauthor Index

1	Maria Battarra	[21]
2	Alberto Caprara	[1] [3] [4] [8] [9] [10] [13] [14] [19] [23]
3	Claudio Cicconetti	[24] [26]
4	Mauro Dell'Amico	[12] [15] [16]
5	Mohammad Dolatabadi	[31]
6	Matteo Fischetti	[1] [18] [22] [27] [30]
7	Pier Luigi Guida	[1] [14]
8	Cor A. J. Hurkens	[29]
9	Manuel Iori	[12] [16]
10	Luciano Lenzini	[24] [26]
11	Marco Locatelli	[10]
12	Andrea Lodi	[2] [3] [5] [9] [13] [23] [24] [26] [29] [31]
13	Enrico Malaguti	[17] [20] [25]
14	Silvano Martello	[2] [6] [12] [13] [16] [24] [26] [29]
15	Enzo Mingozzi	[24] [26]
16	Corrado Pagani	[15]
17	Ulrich Pferschy	[28]
18	Giuseppe Sacco	[1]
19	Paolo Toth	[1] [4] [11] [14] [17] [20] [25]
20	Daniele Vigo	[6] [15] [21]
21	Gerhard J. Woeginger	[29]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page