Maurice Queyranne

2008
28	EE	Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö: Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics 156(5): 556-568 (2008)
27	EE	Maurice Queyranne, Fabio Tardella: Sublattices of product spaces: Hulls, representations and counting. Discrete Mathematics 308(9): 1508-1523 (2008)
2006
26	EE	Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan: Approximation algorithms for shop scheduling problems with minsum objective: A correction. J. Scheduling 9(6): 569-570 (2006)
25	EE	Mabel C. Chou, Maurice Queyranne, David Simchi-Levi: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. Math. Program. 106(1): 137-157 (2006)
24	EE	Maurice Queyranne, Andreas S. Schulz: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. SIAM J. Comput. 35(5): 1241-1253 (2006)
2003
23	EE	Dorit S. Hochbaum, Maurice Queyranne: Minimizing a Convex Cost Closure Set. SIAM J. Discrete Math. 16(2): 192-207 (2003)
2002
22	EE	Maurice Queyranne, Maxim Sviridenko: A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. J. Algorithms 45(2): 202-212 (2002)
21	EE	Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang: Single Machine Scheduling with Release Dates. SIAM J. Discrete Math. 15(2): 165-192 (2002)
2001
20	EE	Maurice Queyranne, Maxim Sviridenko: A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. IPCO 2001: 361-369
19	EE	Cheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi: The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. IPCO 2001: 45-59
2000
18		Dorit S. Hochbaum, Maurice Queyranne: Minimizing a Convex Cost Closure Set. ESA 2000: 256-267
17	EE	Maurice Queyranne, Maxim Sviridenko: New and improved algorithms for minsum shop scheduling. SODA 2000: 871-878
1999
16	EE	Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44
15	EE	Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang: On the Chvátal Rank of Certain Inequalities. IPCO 1999: 218-233
1998
14	EE	Alix Munier, Maurice Queyranne, Andreas S. Schulz: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. IPCO 1998: 367-382
13		Maurice Queyranne: Minimizing symmetric submodular functions. Math. Program. 82: 3-12 (1998)
1997
12	EE	Maurice Queyranne, Frits C. R. Spieksma: Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. Discrete Applied Mathematics 76(1-3): 239-253 (1997)
1996
11		William H. Cunningham, S. Thomas McCormick, Maurice Queyranne: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings Springer 1996
10	EE	Alain Hertz, Maurice Queyranne, Marino Widmer: Preface. Discrete Applied Mathematics 65(1-3): 1-3 (1996)
9	EE	Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich: A feedback strategy for periodic network flows. Networks 27(1): 25-34 (1996)
8	EE	Frieda Granot, Michal Penn, Maurice Queyranne: Disconnecting sets in single and two-terminal-pair networks. Networks 27(2): 117-123 (1996)
1995
7		Maurice Queyranne, Andreas S. Schulz: Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. IPCO 1995: 307-320
6		Maurice Queyranne: A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions. SODA 1995: 98-101
1993
5		Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella: A general class of greedily solvable linear programs. IPCO 1993: 385-399
4	EE	Maurice Queyranne, Daning Sun: The Performance Ratio of Grouping Policies for the Joint Replenishment Problem. Discrete Applied Mathematics 46(1): 43-72 (1993)
3		Maurice Queyranne: Structure of a simple scheduling polyhedron. Math. Program. 58: 263-285 (1993)
2		Maurice Queyranne, Yaoguang Wang: Hamiltonian path and symmetric travelling salesman polytopes. Math. Program. 58: 89-110 (1993)
1992
1		Jean B. Lasserre, Maurice Queyranne: Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. IPCO 1992: 136-149

Coauthor Index

1	Foto N. Afrati	[16]
2	Evripidis Bampis	[16]
3	Franco Blanchini	[9]
4	Chandra Chekuri	[16]
5	Cheng-Feng Mabel Chou	[19]
6	Mabel C. Chou	[25]
7	William H. Cunningham	[11]
8	Gerd Finke	[28]
9	Michel X. Goemans	[21]
10	Frieda Granot	[8]
11	Mark E. Hartmann	[15]
12	Alain Hertz	[10]
13	Dorit S. Hochbaum	[18] [23]
14	Vincent Jost	[28]
15	David R. Karger	[16]
16	Sanjeev Khanna	[16]
17	Alix Munier Kordon (Alix Munier)	[14]
18	Jean B. Lasserre	[1]
19	Wenhua Li	[26]
20	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[16]
21	S. Thomas McCormick	[11]
22	Ioannis Milis	[16]
23	Michal Penn	[8]
24	Franca Rinaldi	[9]
25	Andreas S. Schulz	[7] [14] [21] [24]
26	András Sebö	[28]
27	David Simchi-Levi	[19] [25]
28	Martin Skutella	[16] [21]
29	Frits C. R. Spieksma	[5] [12]
30	Clifford Stein	[16]
31	Daning Sun	[4]
32	Maxim Sviridenko	[16] [17] [20] [22] [26]
33	Fabio Tardella	[5] [27]
34	Walter Ukovich	[9]
35	Yaoguang Wang	[2] [15] [21]
36	Marino Widmer	[10]
37	Jinjiang Yuan	[26]

Colors in the list of coauthors