Maurice Queyranne

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

Collaborative distances:



In proceedings 
PhD thesis 




Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Faster Algorithms for Parametric Global Minimum Cut Problems.
CoRR, 2019

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons.
J. Comb. Optim., 2018

Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations.
Comb., 2018

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling.
Comput. Optim. Appl., 2018

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

Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities.
Math. Oper. Res., 2017

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Math. Program., 2015

Modeling Poset Convex Subsets.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Integer preemptive scheduling on parallel machines.
Oper. Res. Lett., 2012

Structural and algorithmic properties for parametric minimum cuts.
Math. Program., 2012

Technical Note - A Sampling-Based Approach to Appointment Scheduling.
Oper. Res., 2012

The interval ordering problem.
Discret. Appl. Math., 2012

Appointment Scheduling with Discrete Random Durations.
Math. Oper. Res., 2011

Rational Generating Functions and Integer Programming Games.
Oper. Res., 2011

Properties of optimal schedules in preemptive shop scheduling.
Discret. Appl. Math., 2011

Minimizing the sum of weighted completion times in a concurrent open shop.
Oper. Res. Lett., 2010

Separation, dimension, and facet algorithms for node flow polyhedra.
Math. Program., 2010

Multi-index Transportation Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Toward Robust Revenue Management: Competitive Analysis of Online Booking.
Oper. Res., 2009

Minimizing the number of machines for minimum length schedules.
Eur. J. Oper. Res., 2009

Integrality Property in Preemptive Parallel Machine Scheduling.
Proceedings of the Computer Science, 2009

Dynamic Multipriority Patient Scheduling for a Diagnostic Resource.
Oper. Res., 2008

Sublattices of product spaces: Hulls, representations and counting.
Discret. Math., 2008

Batch processing with interval graph compatibilities between tasks.
Discret. Appl. Math., 2008

Clique partitioning of interval graphs with submodular costs on the cliques.
RAIRO Oper. Res., 2007

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
SIAM J. Comput., 2006

Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Sched., 2006

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates.
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.
Oper. Res., 2006

Submodular function minimization in <i>I</i> and searching in Monge arrays.
Electron. Notes Discret. Math., 2004

Submodular Function Minimization in Zeta<sup>n</sup> and Searching in Monge arrays.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

Minimizing a Convex Cost Closure Set.
SIAM J. Discret. Math., 2003

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

Single Machine Scheduling with Release Dates.
SIAM J. Discret. Math., 2002

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

Production and Inventory Model Using Net Present Value.
Oper. Res., 2002

New and improved algorithms for minsum shop scheduling.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the Chvátal Rank of Certain Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Minimizing symmetric submodular functions.
Math. Program., 1998

A General Class of Greedily Solvable Linear Programs.
Math. Oper. Res., 1998

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs.
Discret. Appl. Math., 1997

Ann. Oper. Res., 1997

Disconnecting sets in single and two-terminal-pair networks.
Networks, 1996

A feedback strategy for periodic network flows.
Networks, 1996

Single Resource Multi-Item Inventory Systems.
Oper. Res., 1996

On the Two-Level Uncapacitated Facility Location Problem.
INFORMS J. Comput., 1996

Discret. Appl. Math., 1996

Ladders for Travelling Salesmen.
SIAM J. Optim., 1995

Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes.
Math. Oper. Res., 1995

An Exact Algorithm for Maximum Entropy Sampling.
Oper. Res., 1995

A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions.
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.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Hamiltonian path and symmetric travelling salesman polytopes.
Math. Program., 1993

Structure of a simple scheduling polyhedron.
Math. Program., 1993

The Performance Ratio of Grouping Policies for the Joint Replenishment Problem.
Discret. Appl. Math., 1993

On the convex hull of feasible solutions to certain combinatorial problems.
Oper. Res. Lett., 1992

Lot Sizing Policies for Finite Production Rate Assembly Systems.
Oper. Res., 1992

Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Single-Machine Scheduling Polyhedra with Precedence Constraints.
Math. Oper. Res., 1991

Cut-threshold graphs.
Discret. Appl. Math., 1991

Bounds for Assembly Line Balancing Heuristics.
Oper. Res., 1985

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

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

On the structure of all minimum cuts in a network and applications.
Math. Program., 1982

On Dynamic Programming Methods for Assembly Line Balancing.
Oper. Res., 1982

On the One-Dimensional Space Allocation Problem.
Oper. Res., 1981

Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow Problem.
Math. Oper. Res., 1980

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

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

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

On the integer-valued variables in the linear vertex packing problem.
Math. Program., 1977