Maurice Queyranne

发表

Integer preemptive scheduling on parallel machines

Philippe Baptiste, Maxim Sviridenko, Jacques Carlier, 2012, Oper. Res. Lett..

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

S. Thomas McCormick, Maurice Queyranne, Hassene Aissi, 2020, IPCO.

Preface

Toshihide Ibaraki, Maurice Queyranne, Rainer E. Burkard, 1995, Ann. Oper. Res..

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

Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne, 2015, Mathematical Programming.

Toward Robust Revenue Management: Competitive Analysis of Online Booking

Maurice Queyranne, Michael O. Ball, 2009, Oper. Res..

Technical Note - A Sampling-Based Approach to Appointment Scheduling

Maurice Queyranne, Retsef Levi, Mehmet A. Begen, 2012, Oper. Res..

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

Fabio Tardella, Maurice Queyranne, F. Tardella, 2017, Math. Oper. Res..

A combinatorial algorithm for minimizing symmetric submodular functions

Maurice Queyranne, M. Queyranne, 1995, SODA '95.

Clique partitioning of interval graphs with submodular costs on the cliques

Maurice Queyranne, Vincent Jost, Dion Gijswijt, 2007, RAIRO Oper. Res..

Rational Generating Functions and Integer Programming Games

Maurice Queyranne, Matthias Köppe, Christopher Thomas Ryan, 2008, Oper. Res..

Multi-index Transportation Problems

Frits C. R. Spieksma, Maurice Queyranne, 2009, Encyclopedia of Optimization.

Single-Machine Scheduling Polyhedra with Precedence Constraints

Maurice Queyranne, Yaoguang Wang, M. Queyranne, 1991, Math. Oper. Res..

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

Maurice Queyranne, François Margot, Yaoguang Wang, 2003, Oper. Res..

On Dynamic Programming Methods for Assembly Line Balancing

Edward P. C. Kao, Maurice Queyranne, 1982, Oper. Res..

On the Two-Level Uncapacitated Facility Location Problem

Karen Aardal, Martine Labbé, Maurice Queyranne, 1996, INFORMS J. Comput..

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

Hui Liu, David Simchi-Levi, Maurice Queyranne, 2006, Oper. Res..

An Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling

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

A feedback strategy for periodic network flows

Franco Blanchini, Walter Ukovich, Maurice Queyranne, 1996, Networks.

Lot Sizing Policies for Finite Production Rate Assembly Systems

Maurice Queyranne, Derek R. Atkins, Daning Sun, 1992, Oper. Res..

A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective

Maxim Sviridenko, Maurice Queyranne, M. Queyranne, 2001, IPCO.

Preface

Toshihide Ibaraki, Maurice Queyranne, Rainer E. Burkard, 1997, Ann. Oper. Res..

Submodular function minimization in I and searching in Monge arrays

Maurice Queyranne, 2004, Electron. Notes Discret. Math..

Separation, dimension, and facet algorithms for node flow polyhedra

S. Thomas McCormick, Maurice Queyranne, Maren Martens, 2010, Math. Program..

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

Fabio Tardella, Maurice Queyranne, Éric Balandraud, 2015, Comb..

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

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1982, Math. Program..

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

José R. Correa, Maurice Queyranne, M. Queyranne, 2012 .

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne, 2014, IPCO.

A General Class of Greedily Solvable Linear Programs

Frits C. R. Spieksma, Fabio Tardella, Maurice Queyranne, 1998, Math. Oper. Res..

Properties of optimal schedules in preemptive shop scheduling

Philippe Baptiste, Maxim Sviridenko, Jacques Carlier, 2011, Discret. Appl. Math..

On the Chvátal Rank of Certain Inequalities

Maurice Queyranne, Mark E. Hartmann, Yaoguang Wang, 1999, IPCO.

Disconnecting sets in single and two-terminal-pair networks

Maurice Queyranne, Frieda Granot, Michal Penn, 1996, Networks.

Dynamic Multipriority Patient Scheduling for a Diagnostic Resource

Maurice Queyranne, Martin L. Puterman, Jonathan Patrick, 2008, Oper. Res..

On the One-Dimensional Space Allocation Problem

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1981, Oper. Res..

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

Maurice Queyranne, Jean B. Lasserre, J. Lasserre, 1992, IPCO.

Chromatic Batch Scheduling: a unifying framework for common generalisations

Gerd Finke, Maurice Queyranne, Vincent Jost, 2006 .

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

David Simchi-Levi, Maurice Queyranne, Mabel C. Chou, 2001, Math. Program..

An Exact Algorithm for Maximum Entropy Sampling

Maurice Queyranne, Jon Lee, Chun-Wa Ko, 1995, Oper. Res..

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

Maurice Queyranne, Eduardo Moreno, Marcos Goycoolea, 2016, Comput. Optim. Appl..

Batch Scheduling with task compatibilities

Gerd Finke, Maurice Queyranne, Vincent Jost, 2005 .

Minimizing the number of machines for minimum length schedules

Gerd Finke, Maurice Queyranne, Jean-Marie Proth, 2009, Eur. J. Oper. Res..

Structure of a simple scheduling polyhedron

Maurice Queyranne, M. Queyranne, 1993, Math. Program..

Production and Inventory Model Using Net Present Value

Maurice Queyranne, Daning Sun, M. Queyranne, 2002, Oper. Res..

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

Laurence A. Wolsey, Maurice Queyranne, 2018, J. Comb. Optim..

Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs

Frits C. R. Spieksma, Maurice Queyranne, F. Spieksma, 1997, Discret. Appl. Math..

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

Maxim Sviridenko, Maurice Queyranne, Jinjiang Yuan, 2006, J. Sched..

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

Maurice Queyranne, Andreas S. Schulz, Alix Munier Kordon, 1998, IPCO.

Approximation schemes for minimizing average weighted completion time with release dates

Evripidis Bampis, Claire Mathieu, David R. Karger, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

On the asymptotic optimality of algorithms for the flow shop problem with release dates

David Simchi-Levi, Maurice Queyranne, Hui Liu, 2005 .

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

S. Thomas McCormick, Maurice Queyranne, William H. Cunningham, 1996 .

Preface

Maurice Queyranne, Alain Hertz, Marino Widmer, 1996, Discret. Appl. Math..

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

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1982, Networks.

Sublattices of product spaces: Hulls, representations and counting

Fabio Tardella, Maurice Queyranne, 2008, Discret. Math..

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

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1978, Oper. Res..

The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates

David Simchi-Levi, Maurice Queyranne, Cheng-Feng Mabel Chou, 2001, IPCO.

Integer Programming and Combinatorial Optimization

S. Thomas McCormick, Maurice Queyranne, William H. Cunningham, 1996, Lecture Notes in Computer Science.

Hamiltonian path and symmetric travelling salesman polytopes

Maurice Queyranne, Yaoguang Wang, M. Queyranne, 1993, Math. Program..

On the convex hull of feasible solutions to certain combinatorial problems

Maurice Queyranne, Yaoguang Wang, 1992, Oper. Res. Lett..

An Introduction to Submodular Functions and Optimization

Maurice Queyranne, M. Queyranne, 2002 .

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

Ola Svensson, Maurice Queyranne, Andreas S. Schulz, 2010, Oper. Res. Lett..

Polyhedral Approaches to Machine Scheduling

Maurice Queyranne, Andreas S. Schulz, M. Queyranne, 2008 .

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

Maxim Sviridenko, Maurice Queyranne, M. Queyranne, 2002, J. Algorithms.

Minimizing symmetric submodular functions

Maurice Queyranne, M. Queyranne, 1998, Math. Program..

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

Maurice Queyranne, M. Queyranne, 1980, Math. Oper. Res..

Minimizing a Convex Cost Closure Set

Maurice Queyranne, Dorit S. Hochbaum, D. Hochbaum, 2000, SIAM J. Discret. Math..

Ladders for Travelling Salesmen

Maurice Queyranne, William H. Cunningham, Yaoguang Wang, 1995, SIAM J. Optim..

4. Production Planning

Maurice Queyranne, Nadia Brauner, Gerd Finke and, 2014 .

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

Laurence A. Wolsey, Maurice Queyranne, L. Wolsey, 2017, Math. Program..

Submodular Function Minimization in Zetan and Searching in Monge arrays

Maurice Queyranne, 2004, CTW.

Special Issue of INFOR Graphs, Networks and Integer Programming

Maurice Queyranne, Benjamin T. Smith, 2004 .

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

Maurice Queyranne, Andreas S. Schulz, M. Queyranne, 1995, IPCO.

Batch Processing with Graph Compatibilities between Tasks

Gerd Finke, Maurice Queyranne, Vincent Jost, 2008 .

The Interval Ordering Problem

Frits C. R. Spieksma, Gerhard J. Woeginger, Fabrice Talla Nobibon, 2010, Discret. Appl. Math..

Cut-threshold graphs

Peter L. Hammer, Maurice Queyranne, Frédéric Maffray, 1991, Discret. Appl. Math..

Single Machine Scheduling with Release Dates

Martin Skutella, Michel X. Goemans, Maurice Queyranne, 2002, SIAM J. Discret. Math..

Bounds for Assembly Line Balancing Heuristics

Maurice Queyranne, M. Queyranne, 1985, Oper. Res..

New and improved algorithms for minsum shop scheduling

Maxim Sviridenko, Maurice Queyranne, M. Queyranne, 2000, SODA '00.

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

Maurice Queyranne, Andreas S. Schulz, M. Queyranne, 1998, SIAM J. Comput..

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

Maurice Queyranne, 1977 .

Integrality Property in Preemptive Parallel Machine Scheduling

Philippe Baptiste, Maxim Sviridenko, Jacques Carlier, 2009, CSR.

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

Maurice Queyranne, 1984, Networks.

The Performance Ratio of Grouping Policies for the Joint Replenishment Problem

Maurice Queyranne, Daning Sun, 1993, Discret. Appl. Math..

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

Maurice Queyranne, 1978, Oper. Res..

Modeling Poset Convex Subsets

Laurence A. Wolsey, Maurice Queyranne, L. Wolsey, 2015, CTW.

Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes

Maurice Queyranne, Yaoguang Wang, 1995, Math. Oper. Res..

Appointment Scheduling with Discrete Random Durations

Maurice Queyranne, Mehmet A. Begen, M. Queyranne, 2009, Math. Oper. Res..

Single Resource Multi-Item Inventory Systems

David Simchi-Levi, Maurice Queyranne, Guillermo Gallego, 1996, Oper. Res..

Structural and algorithmic properties for parametric minimum cuts

Fabio Tardella, S. Thomas McCormick, Maurice Queyranne, 2012, Math. Program..

Batch processing with interval graph compatibilities between tasks

Gerd Finke, Maurice Queyranne, Vincent Jost, 2005, Discret. Appl. Math..

Approximation algorithms for shop scheduling problems with minsum objective

Maxim Sviridenko, Maurice Queyranne, M. Queyranne, 2002 .

On finding the K best cuts in a network

Horst W. Hamacher, Maurice Queyranne, Jean-Claude Picard, 1984 .

Disconnecting sets in single and two‐terminal‐pair networks

Maurice Queyranne, Frieda Granot, Michal Penn, 1996 .

Inventory coordination and pricing decisions: analysis of a simple class of heuristics

Maurice Queyranne, Guillermo Gallego, M. Queyranne, 1995 .

A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs

Maurice Queyranne, Alain Bensoussan, A. Bensoussan, 1991 .

A feedback strategy for periodic network flows

Franco Blanchini, Walter Ukovich, Maurice Queyranne, 1996 .

Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996 : proceedings

S. Thomas McCormick, Maurice Queyranne, William H. Cunningham, 1996 .

On Optimum k-way Partitions with Submodular Costs and Minimum Part-size Constraints

Maurice Queyranne, 2012 .

Bimonotone linear inequalities and sublattices of Rn

Fabio Tardella, Maurice Queyranne, F. Tardella, 2006 .

Optimal pits and optimal transportation

Maurice Queyranne, Ivar Ekeland, I. Ekeland, 2015 .

Minimizing a Convex Cost Closure Set

Maurice Queyranne, Dorit S. Hochbaum, 2003, SIAM J. Discret. Math..