Maurice Queyranne

According to our database, Maurice Queyranne authored at least 75 papers between 1977 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.

Hassene Aissi, S. Thomas McCormick, Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Faster Algorithms for Parametric Global Minimum Cut Problems.

Hassene Aissi, S. Thomas McCormick, Maurice Queyranne

CoRR, 2019

2018

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons.

Maurice Queyranne, Laurence A. Wolsey

J. Comb. Optim., 2018

Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations.

Éric Balandraud, Fabio Tardella, Maurice Queyranne

Comb., 2018

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling.

Gonzalo Muñoz, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Maurice Queyranne, Orlando Rivera Letelier

Comput. Optim. Appl., 2018

2017

Tight MIP formulations for bounded up/down times and interval-dependent start-ups.

Maurice Queyranne, Laurence A. Wolsey

Math. Program., 2017

Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities.

Maurice Queyranne, Fabio Tardella

Math. Oper. Res., 2017

2015

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.

Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne

Math. Program., 2015

Modeling Poset Convex Subsets.

Maurice Queyranne, Laurence A. Wolsey

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.

Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2012

Integer preemptive scheduling on parallel machines.

Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko

Oper. Res. Lett., 2012

Structural and algorithmic properties for parametric minimum cuts.

Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella

Math. Program., 2012

Technical Note - A Sampling-Based Approach to Appointment Scheduling.

Mehmet A. Begen, Retsef Levi, Maurice Queyranne

Oper. Res., 2012

The interval ordering problem.

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger

Discret. Appl. Math., 2012

2011

Appointment Scheduling with Discrete Random Durations.

Mehmet A. Begen, Maurice Queyranne

Math. Oper. Res., 2011

Rational Generating Functions and Integer Programming Games.

Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne

Oper. Res., 2011

Properties of optimal schedules in preemptive shop scheduling.

Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko

Discret. Appl. Math., 2011

2010

Minimizing the sum of weighted completion times in a concurrent open shop.

Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan

Oper. Res. Lett., 2010

Separation, dimension, and facet algorithms for node flow polyhedra.

Maren Martens, S. Thomas McCormick, Maurice Queyranne

Math. Program., 2010

2009

Multi-index Transportation Problems.

Maurice Queyranne, Frits C. R. Spieksma

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Toward Robust Revenue Management: Competitive Analysis of Online Booking.

Michael O. Ball, Maurice Queyranne

Oper. Res., 2009

Minimizing the number of machines for minimum length schedules.

Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne

Eur. J. Oper. Res., 2009

Integrality Property in Preemptive Parallel Machine Scheduling.

Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko

Proceedings of the Computer Science, 2009

2008

Dynamic Multipriority Patient Scheduling for a Diagnostic Resource.

Jonathan Patrick, Martin L. Puterman, Maurice Queyranne

Oper. Res., 2008

Sublattices of product spaces: Hulls, representations and counting.

Maurice Queyranne, Fabio Tardella

Discret. Math., 2008

Batch processing with interval graph compatibilities between tasks.

Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö

Discret. Appl. Math., 2008

2007

Clique partitioning of interval graphs with submodular costs on the cliques.

Dion Gijswijt, Vincent Jost, Maurice Queyranne

RAIRO Oper. Res., 2007

2006

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.

Maurice Queyranne, Andreas S. Schulz

SIAM J. Comput., 2006

Approximation algorithms for shop scheduling problems with minsum objective: A correction.

Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan

J. Sched., 2006

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates.

Mabel C. Chou, Maurice Queyranne, David Simchi-Levi

Math. Program., 2006

On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions.

Mabel C. Chou, Hui Liu, Maurice Queyranne, David Simchi-Levi

Oper. Res., 2006

2004

Submodular function minimization in <i>I</i> and searching in Monge arrays.

Maurice Queyranne

Electron. Notes Discret. Math., 2004

Submodular Function Minimization in Zetaⁿ and Searching in Monge arrays.

Maurice Queyranne

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003

Minimizing a Convex Cost Closure Set.

Dorit S. Hochbaum, Maurice Queyranne

SIAM J. Discret. Math., 2003

Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem.

François Margot, Maurice Queyranne, Yaoguang Wang

Oper. Res., 2003

2002

Single Machine Scheduling with Release Dates.

Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang

SIAM J. Discret. Math., 2002

A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective.

Maurice Queyranne, Maxim Sviridenko

J. Algorithms, 2002

Production and Inventory Model Using Net Present Value.

Daning Sun, Maurice Queyranne

Oper. Res., 2002

2000

New and improved algorithms for minsum shop scheduling.

Maurice Queyranne, Maxim Sviridenko

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

On the Chvátal Rank of Certain Inequalities.

Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Minimizing symmetric submodular functions.

Maurice Queyranne

Math. Program., 1998

A General Class of Greedily Solvable Linear Programs.

Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella

Math. Oper. Res., 1998

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.

Alix Munier, Maurice Queyranne, Andreas S. Schulz

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs.

Maurice Queyranne, Frits C. R. Spieksma

Discret. Appl. Math., 1997

Preface.

Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne

Ann. Oper. Res., 1997

1996

Disconnecting sets in single and two-terminal-pair networks.

Frieda Granot, Michal Penn, Maurice Queyranne

Networks, 1996

A feedback strategy for periodic network flows.

Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich

Networks, 1996

Single Resource Multi-Item Inventory Systems.

Guillermo Gallego, Maurice Queyranne, David Simchi-Levi

Oper. Res., 1996

On the Two-Level Uncapacitated Facility Location Problem.

Karen I. Aardal, Martine Labbé, Janny Leung, Maurice Queyranne

INFORMS J. Comput., 1996

Preface.

Alain Hertz, Maurice Queyranne, Marino Widmer

Discret. Appl. Math., 1996

1995

Ladders for Travelling Salesmen.

Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang

SIAM J. Optim., 1995

Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes.

Maurice Queyranne, Yaoguang Wang

Math. Oper. Res., 1995

An Exact Algorithm for Maximum Entropy Sampling.

Chun-Wa Ko, Jon Lee, Maurice Queyranne

Oper. Res., 1995

A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions.

Maurice Queyranne

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds.

Maurice Queyranne, Andreas S. Schulz

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1993

Hamiltonian path and symmetric travelling salesman polytopes.

Maurice Queyranne, Yaoguang Wang

Math. Program., 1993

Structure of a simple scheduling polyhedron.

Maurice Queyranne

Math. Program., 1993

The Performance Ratio of Grouping Policies for the Joint Replenishment Problem.

Maurice Queyranne, Daning Sun

Discret. Appl. Math., 1993

1992

On the convex hull of feasible solutions to certain combinatorial problems.

Maurice Queyranne, Yaoguang Wang

Oper. Res. Lett., 1992

Lot Sizing Policies for Finite Production Rate Assembly Systems.

Derek R. Atkins, Maurice Queyranne, Daning Sun

Oper. Res., 1992

Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling.

Jean B. Lasserre, Maurice Queyranne

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

Single-Machine Scheduling Polyhedra with Precedence Constraints.

Maurice Queyranne, Yaoguang Wang

Math. Oper. Res., 1991

Cut-threshold graphs.

Peter L. Hammer, Frédéric Maffray, Maurice Queyranne

Discret. Appl. Math., 1991

1985

Bounds for Assembly Line Balancing Heuristics.

Maurice Queyranne

Oper. Res., 1985

1984

Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95.

Maurice Queyranne

Networks, 1984

1982

A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory.

Jean-Claude Picard, Maurice Queyranne

Networks, 1982

On the structure of all minimum cuts in a network and applications.

Jean-Claude Picard, Maurice Queyranne

Math. Program., 1982

On Dynamic Programming Methods for Assembly Line Balancing.

Edward P. C. Kao, Maurice Queyranne

Oper. Res., 1982

1981

On the One-Dimensional Space Allocation Problem.

Jean-Claude Picard, Maurice Queyranne

Oper. Res., 1981

1980

Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow Problem.

Maurice Queyranne

Math. Oper. Res., 1980

1978

Letter to the Editor - On "A 'Hard' Assignment Problem" by Machol and Wien.

Maurice Queyranne

Oper. Res., 1978

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling.

Jean-Claude Picard, Maurice Queyranne

Oper. Res., 1978

1977

Le Problème du voyageur de commerce à coûts variables et quelques applications.

Maurice Queyranne

PhD thesis, 1977

On the integer-valued variables in the linear vertex packing problem.

Jean-Claude Picard, Maurice Queyranne

Math. Program., 1977