Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Maurice Queyranne
2010 – today
- 2012
[j37]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. Discrete Applied Mathematics 160(7-8): 1094-1103 (2012)- [j36]Mehmet A. Begen, Retsef Levi, Maurice Queyranne: Technical Note - A Sampling-Based Approach to Appointment Scheduling. Operations Research 60(3): 675-681 (2012)
- [j35]Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella: Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135(1-2): 337-367 (2012)
- [j34]Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012)
- 2011
- [j33]Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Properties of optimal schedules in preemptive shop scheduling. Discrete Applied Mathematics 159(5): 272-280 (2011)
- [j32]Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne: Rational Generating Functions and Integer Programming Games. Operations Research 59(6): 1445-1460 (2011)
- [j31]Mehmet A. Begen, Maurice Queyranne: Appointment Scheduling with Discrete Random Durations. Math. Oper. Res. 36(2): 240-257 (2011)
- [i2]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. CoRR abs/1112.0534 (2011)
- 2010
- [j30]Maren Martens, S. Thomas McCormick, Maurice Queyranne: Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124(1-2): 317-348 (2010)
- [j29]Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan: Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5): 390-395 (2010)
2000 – 2009
- 2009
- [j28]Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne: Minimizing the number of machines for minimum length schedules. European Journal of Operational Research 199(3): 702-705 (2009)
- [j27]Michael O. Ball, Maurice Queyranne: Toward Robust Revenue Management: Competitive Analysis of Online Booking. Operations Research 57(4): 950-963 (2009)
- [c14]Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46
- [c13]Mehmet A. Begen, Maurice Queyranne: Appointment scheduling with discrete random durations. SODA 2009: 845-854
- [r1]Maurice Queyranne, Frits C. R. Spieksma: Multi-index Transportation Problems. Encyclopedia of Optimization 2009: 2413-2419
- 2008
- [j26]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)
- [j25]Maurice Queyranne, Fabio Tardella: Sublattices of product spaces: Hulls, representations and counting. Discrete Mathematics 308(9): 1508-1523 (2008)
- [j24]Jonathan Patrick, Martin L. Puterman, Maurice Queyranne: Dynamic Multipriority Patient Scheduling for a Diagnostic Resource. Operations Research 56(6): 1507-1525 (2008)
- [i1]Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne: Rational Generating Functions and Integer Programming Games. CoRR abs/0809.0689 (2008)
- 2007
- [j23]Dion Gijswijt, Vincent Jost, Maurice Queyranne: Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO - Operations Research 41(3): 275-287 (2007)
- 2006
- [j22]Mabel C. Chou, Hui Liu, Maurice Queyranne, David Simchi-Levi: On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions. Operations Research 54(3): 464-474 (2006)
- [j21]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)
- [j20]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)
- [j19]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)
- 2004
- [j18]Maurice Queyranne: Submodular function minimization in I and searching in Monge arrays. Electronic Notes in Discrete Mathematics 17: 5 (2004)
- [c12]Maurice Queyranne: Submodular Function Minimization in Zetan and Searching in Monge arrays. CTW 2004: 13
- 2003
- [j17]François Margot, Maurice Queyranne, Yaoguang Wang: Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem. Operations Research 51(6): 981-992 (2003)
- [j16]Dorit S. Hochbaum, Maurice Queyranne: Minimizing a Convex Cost Closure Set. SIAM J. Discrete Math. 16(2): 192-207 (2003)
- 2002
- [j15]Daning Sun, Maurice Queyranne: Production and Inventory Model Using Net Present Value. Operations Research 50(3): 528-537 (2002)
- [j14]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)
- [j13]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
- [c11]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
- [c10]Maurice Queyranne, Maxim Sviridenko: A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. IPCO 2001: 361-369
- 2000
- [c9]
- [c8]Maurice Queyranne, Maxim Sviridenko: New and improved algorithms for minsum shop scheduling. SODA 2000: 871-878
1990 – 1999
- 1999
- [c7]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
- [c6]Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang: On the Chvátal Rank of Certain Inequalities. IPCO 1999: 218-233
- 1998
- [j12]
- [c5]Alix Munier, Maurice Queyranne, Andreas S. Schulz: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. IPCO 1998: 367-382
- 1997
- [j11]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
- [j10]Alain Hertz, Maurice Queyranne, Marino Widmer: Preface. Discrete Applied Mathematics 65(1-3): 1-3 (1996)
- [j9]Karen Aardal, Martine Labbé, Janny Leung, Maurice Queyranne: On the Two-Level Uncapacitated Facility Location Problem. INFORMS Journal on Computing 8(3): 289-301 (1996)
- [j8]Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich: A feedback strategy for periodic network flows. Networks 27(1): 25-34 (1996)
- [j7]Frieda Granot, Michal Penn, Maurice Queyranne: Disconnecting sets in single and two-terminal-pair networks. Networks 27(2): 117-123 (1996)
- [e1]William H. Cunningham, S. Thomas McCormick, Maurice Queyranne (Eds.): Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1084, Springer 1996, ISBN 3-540-61310-2
- 1995
- [c4]Maurice Queyranne, Andreas S. Schulz: Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. IPCO 1995: 307-320
- [c3]Maurice Queyranne: A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions. SODA 1995: 98-101
- 1993
- [j6]Maurice Queyranne, Daning Sun: The Performance Ratio of Grouping Policies for the Joint Replenishment Problem. Discrete Applied Mathematics 46(1): 43-72 (1993)
- [j5]Maurice Queyranne, Yaoguang Wang: Hamiltonian path and symmetric travelling salesman polytopes. Math. Program. 58: 89-110 (1993)
- [j4]
- [c2]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella: A general class of greedily solvable linear programs. IPCO 1993: 385-399
- 1992
- [c1]Jean B. Lasserre, Maurice Queyranne: Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. IPCO 1992: 136-149
- 1991
- [j3]Peter L. Hammer, Frédéric Maffray, Maurice Queyranne: Cut-threshold graphs. Discrete Applied Mathematics 30(2-3): 163-179 (1991)
1980 – 1989
- 1984
- [j2]Maurice Queyranne, Qms-Mcelhinney: Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95. Networks 14(1): 174-175 (1984)
- 1982
- [j1]Jean-Claude Picard, Maurice Queyranne: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. Networks 12(2): 141-159 (1982)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-25 23:43 CET by the dblp team