Search the dblp DataBase

Publications of Author

1. Dorit S. Hochbaum, Maurice Queyranne
   Minimizing a Convex Cost Closure Set. [Citation Graph (0, 0)][DBLP]
   ESA, 2000, pp:256-267 [Conf]
   
2. 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. [Citation Graph (0, 0)][DBLP]
   FOCS, 1999, pp:32-44 [Conf]
   
3. 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. [Citation Graph (0, 0)][DBLP]
   IPCO, 2001, pp:45-59 [Conf]
   
4. Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang
   On the Chvátal Rank of Certain Inequalities. [Citation Graph (0, 0)][DBLP]
   IPCO, 1999, pp:218-233 [Conf]
   
5. Jean B. Lasserre, Maurice Queyranne
   Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. [Citation Graph (0, 0)][DBLP]
   IPCO, 1992, pp:136-149 [Conf]
   
6. Alix Munier, Maurice Queyranne, Andreas S. Schulz
   Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
   IPCO, 1998, pp:367-382 [Conf]
   
7. Maurice Queyranne, Maxim Sviridenko
   A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. [Citation Graph (0, 0)][DBLP]
   IPCO, 2001, pp:361-369 [Conf]
   
8. Maurice Queyranne, Andreas S. Schulz
   Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. [Citation Graph (0, 0)][DBLP]
   IPCO, 1995, pp:307-320 [Conf]
   
9. Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella
   A general class of greedily solvable linear programs. [Citation Graph (0, 0)][DBLP]
   IPCO, 1993, pp:385-399 [Conf]
   
10. Maurice Queyranne
    A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:98-101 [Conf]
    
11. Maurice Queyranne, Maxim Sviridenko
    New and improved algorithms for minsum shop scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:871-878 [Conf]
    
12. Alain Hertz, Maurice Queyranne, Marino Widmer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:1-3 [Journal]
    
13. Maurice Queyranne, Daning Sun
    The Performance Ratio of Grouping Policies for the Joint Replenishment Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:1, pp:43-72 [Journal]
    
14. Maurice Queyranne, Frits C. R. Spieksma
    Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:239-253 [Journal]
    
15. Maurice Queyranne, Maxim Sviridenko
    A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:202-212 [Journal]
    
16. 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. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:1, pp:137-157 [Journal]
    
17. Maurice Queyranne
    Structure of a simple scheduling polyhedron. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:58, n:, pp:263-285 [Journal]
    
18. Maurice Queyranne
    Minimizing symmetric submodular functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:3-12 [Journal]
    
19. Maurice Queyranne, Yaoguang Wang
    Hamiltonian path and symmetric travelling salesman polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:58, n:, pp:89-110 [Journal]
    
20. Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich
    A feedback strategy for periodic network flows. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:1, pp:25-34 [Journal]
    
21. Frieda Granot, Michal Penn, Maurice Queyranne
    Disconnecting sets in single and two-terminal-pair networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:2, pp:117-123 [Journal]
    
22. Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan
    Approximation algorithms for shop scheduling problems with minsum objective: A correction. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:6, pp:569-570 [Journal]
    
23. Maurice Queyranne, Andreas S. Schulz
    Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1241-1253 [Journal]
    
24. Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang
    Single Machine Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:165-192 [Journal]
    
25. Dorit S. Hochbaum, Maurice Queyranne
    Minimizing a Convex Cost Closure Set. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:192-207 [Journal]
    
26. 
    Integrality Property in Preemptive Parallel Machine Scheduling. [Citation Graph (, )][DBLP]
    
    
27. 
    Appointment scheduling with discrete random durations. [Citation Graph (, )][DBLP]
    
    
28. 
    Rational Generating Functions and Integer Programming Games [Citation Graph (, )][DBLP]
    
    
29. 
    Batch processing with interval graph compatibilities between tasks. [Citation Graph (, )][DBLP]
    
    
30. 
    Cut-threshold graphs. [Citation Graph (, )][DBLP]
    
    
31. 
    Sublattices of product spaces: Hulls, representations and counting. [Citation Graph (, )][DBLP]