![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Maurice Queyranne
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c16]Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO 2020: 27-39
2010 – 2019
- 2019
- [i4]Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR abs/1911.11847 (2019) - 2018
- [j61]Gonzalo Muñoz
, Daniel G. Espinoza, Marcos Goycoolea
, Eduardo Moreno
, Maurice Queyranne, Orlando Rivera Letelier:
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. Comput. Optim. Appl. 69(2): 501-534 (2018) - [j60]Éric Balandraud, Fabio Tardella, Maurice Queyranne:
Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations. Comb. 38(1): 29-41 (2018) - [j59]Maurice Queyranne
, Laurence A. Wolsey:
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons. J. Comb. Optim. 36(1): 90-107 (2018) - 2017
- [j58]Maurice Queyranne, Fabio Tardella:
Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities. Math. Oper. Res. 42(2): 495-516 (2017) - [j57]Maurice Queyranne, Laurence A. Wolsey
:
Tight MIP formulations for bounded up/down times and interval-dependent start-ups. Math. Program. 164(1-2): 129-155 (2017) - 2015
- [j56]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154(1-2): 3-28 (2015) - [i3]Maurice Queyranne, Laurence A. Wolsey:
Modeling Poset Convex Subsets. CTW 2015: 165-168 - 2014
- [c15]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO 2014: 25-36 - 2012
- [j55]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma
, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. Discret. Appl. Math. 160(7-8): 1094-1103 (2012) - [j54]Mehmet A. Begen
, Retsef Levi, Maurice Queyranne:
Technical Note - A Sampling-Based Approach to Appointment Scheduling. Oper. Res. 60(3): 675-681 (2012) - [j53]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) - [j52]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov
, Maxim Sviridenko:
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012) - 2011
- [j51]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov
, Maxim Sviridenko:
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011) - [j50]Matthias Köppe
, Christopher Thomas Ryan, Maurice Queyranne:
Rational Generating Functions and Integer Programming Games. Oper. Res. 59(6): 1445-1460 (2011) - [j49]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
- [j48]Maren Martens, S. Thomas McCormick, Maurice Queyranne:
Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124(1-2): 317-348 (2010) - [j47]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
- [j46]Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne:
Minimizing the number of machines for minimum length schedules. Eur. J. Oper. Res. 199(3): 702-705 (2009) - [j45]Michael O. Ball, Maurice Queyranne:
Toward Robust Revenue Management: Competitive Analysis of Online Booking. Oper. Res. 57(4): 950-963 (2009) - [c14]Philippe Baptiste, Jacques Carlier, Alexander V. 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
- [j44]Gerd Finke, Vincent Jost
, Maurice Queyranne, András Sebö:
Batch processing with interval graph compatibilities between tasks. Discret. Appl. Math. 156(5): 556-568 (2008) - [j43]Maurice Queyranne, Fabio Tardella:
Sublattices of product spaces: Hulls, representations and counting. Discret. Math. 308(9): 1508-1523 (2008) - [j42]Jonathan Patrick, Martin L. Puterman, Maurice Queyranne:
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource. Oper. Res. 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
- [j41]Dion Gijswijt
, Vincent Jost, Maurice Queyranne:
Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO Oper. Res. 41(3): 275-287 (2007) - 2006
- [j40]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. Oper. Res. 54(3): 464-474 (2006) - [j39]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) - [j38]Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan:
Approximation algorithms for shop scheduling problems with minsum objective: A correction. J. Sched. 9(6): 569-570 (2006) - [j37]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
- [j36]Maurice Queyranne:
Submodular function minimization in I and searching in Monge arrays. Electron. Notes Discret. Math. 17: 5 (2004) - [c12]Maurice Queyranne:
Submodular Function Minimization in Zetan and Searching in Monge arrays. CTW 2004: 13 - 2003
- [j35]François Margot, Maurice Queyranne, Yaoguang Wang:
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem. Oper. Res. 51(6): 981-992 (2003) - [j34]Dorit S. Hochbaum, Maurice Queyranne:
Minimizing a Convex Cost Closure Set. SIAM J. Discret. Math. 16(2): 192-207 (2003) - 2002
- [j33]Daning Sun, Maurice Queyranne:
Production and Inventory Model Using Net Present Value. Oper. Res. 50(3): 528-537 (2002) - [j32]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) - [j31]Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz
, Martin Skutella, Yaoguang Wang:
Single Machine Scheduling with Release Dates. SIAM J. Discret. 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]Dorit S. Hochbaum, Maurice Queyranne:
Minimizing a Convex Cost Closure Set. ESA 2000: 256-267 - [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
- [j30]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A General Class of Greedily Solvable Linear Programs. Math. Oper. Res. 23(4): 892-908 (1998) - [j29]Maurice Queyranne:
Minimizing symmetric submodular functions. Math. Program. 82: 3-12 (1998) - [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
- [j28]Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne:
Preface. Ann. Oper. Res. 69: 0 (1997) - [j27]Maurice Queyranne, Frits C. R. Spieksma
:
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. Discret. Appl. Math. 76(1-3): 239-253 (1997) - 1996
- [j26]Alain Hertz, Maurice Queyranne, Marino Widmer:
Preface. Discret. Appl. Math. 65(1-3): 1-3 (1996) - [j25]Karen I. Aardal, Martine Labbé
, Janny Leung
, Maurice Queyranne:
On the Two-Level Uncapacitated Facility Location Problem. INFORMS J. Comput. 8(3): 289-301 (1996) - [j24]Guillermo Gallego
, Maurice Queyranne, David Simchi-Levi:
Single Resource Multi-Item Inventory Systems. Oper. Res. 44(4): 580-595 (1996) - [j23]Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich:
A feedback strategy for periodic network flows. Networks 27(1): 25-34 (1996) - [j22]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:
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 [contents] - 1995
- [j21]Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne:
Preface. Ann. Oper. Res. 57(1) (1995) - [j20]Chun-Wa Ko, Jon Lee, Maurice Queyranne:
An Exact Algorithm for Maximum Entropy Sampling. Oper. Res. 43(4): 684-691 (1995) - [j19]Maurice Queyranne, Yaoguang Wang:
Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes. Math. Oper. Res. 20(4): 838-863 (1995) - [j18]Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang:
Ladders for Travelling Salesmen. SIAM J. Optim. 5(2): 408-420 (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
- [j17]Maurice Queyranne, Daning Sun:
The Performance Ratio of Grouping Policies for the Joint Replenishment Problem. Discret. Appl. Math. 46(1): 43-72 (1993) - [j16]Maurice Queyranne, Yaoguang Wang:
Hamiltonian path and symmetric travelling salesman polytopes. Math. Program. 58: 89-110 (1993) - [j15]Maurice Queyranne:
Structure of a simple scheduling polyhedron. Math. Program. 58: 263-285 (1993) - [c2]Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A general class of greedily solvable linear programs. IPCO 1993: 385-399 - 1992
- [j14]Derek R. Atkins, Maurice Queyranne, Daning Sun:
Lot Sizing Policies for Finite Production Rate Assembly Systems. Oper. Res. 40(1): 126-141 (1992) - [j13]Maurice Queyranne, Yaoguang Wang:
On the convex hull of feasible solutions to certain combinatorial problems. Oper. Res. Lett. 11(1): 1-11 (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
- [j12]Peter L. Hammer, Frédéric Maffray, Maurice Queyranne:
Cut-threshold graphs. Discret. Appl. Math. 30(2-3): 163-179 (1991) - [j11]Maurice Queyranne, Yaoguang Wang:
Single-Machine Scheduling Polyhedra with Precedence Constraints. Math. Oper. Res. 16(1): 1-20 (1991)
1980 – 1989
- 1985
- [j10]Maurice Queyranne:
Bounds for Assembly Line Balancing Heuristics. Oper. Res. 33(6): 1353-1359 (1985) - 1984
- [j9]Maurice Queyranne:
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
- [j8]Edward P. C. Kao, Maurice Queyranne:
On Dynamic Programming Methods for Assembly Line Balancing. Oper. Res. 30(2): 375-390 (1982) - [j7]Jean-Claude Picard, Maurice Queyranne:
On the structure of all minimum cuts in a network and applications. Math. Program. 22(1): 121 (1982) - [j6]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) - 1981
- [j5]Jean-Claude Picard, Maurice Queyranne:
On the One-Dimensional Space Allocation Problem. Oper. Res. 29(2): 371-391 (1981) - 1980
- [j4]Maurice Queyranne:
Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow Problem. Math. Oper. Res. 5(2): 258-266 (1980)
1970 – 1979
- 1978
- [j3]Jean-Claude Picard, Maurice Queyranne:
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling. Oper. Res. 26(1): 86-110 (1978) - [j2]Maurice Queyranne:
Letter to the Editor - On "A 'Hard' Assignment Problem" by Machol and Wien. Oper. Res. 26(2): 376 (1978) - 1977
- [b1]Maurice Queyranne:
Le Problème du voyageur de commerce à coûts variables et quelques applications. Joseph Fourier University, Grenoble, France, 1977 - [j1]Jean-Claude Picard, Maurice Queyranne:
On the integer-valued variables in the linear vertex packing problem. Math. Program. 12(1): 97-101 (1977)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint