Maurice Queyranne - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 79 from 79

2020

Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum CutsHassene Aissi, S. Thomas McCormick, Maurice Queyranne. ipco 2020: 27-39 [doi]

2018

2017

Tight MIP formulations for bounded up/down times and interval-dependent start-upsMaurice Queyranne, Laurence A. Wolsey. mp, 164(1-2):129-155, 2017. [doi]

Carathéodory, Helly, and Radon Numbers for Sublattice and Related ConvexitiesMaurice Queyranne, Fabio Tardella. mor, 42(2):495-516, 2017. [doi]

2015

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphsHassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne. mp, 154(1-2):3-28, 2015. [doi]

Modeling Poset Convex SubsetsMaurice Queyranne, Laurence Wolsey. colognetwente 2015: 165-168

2014

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum CutsHassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne. ipco 2014: 25-36 [doi]

2012

Integer preemptive scheduling on parallel machinesPhilippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko. orl, 40(6):440-444, 2012. [doi]

Technical Note - A Sampling-Based Approach to Appointment SchedulingMehmet A. Begen, Retsef Levi, Maurice Queyranne. ior, 60(3):675-681, 2012. [doi]

The interval ordering problemChristoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger. DAM, 160(7-8):1094-1103, 2012. [doi]

Structural and algorithmic properties for parametric minimum cutsFrieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella. mp, 135(1-2):337-367, 2012. [doi]

2011

Properties of optimal schedules in preemptive shop schedulingPhilippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko. DAM, 159(5):272-280, 2011. [doi]

Appointment Scheduling with Discrete Random DurationsMehmet A. Begen, Maurice Queyranne. mor, 36(2):240-257, 2011. [doi]

Rational Generating Functions and Integer Programming GamesMatthias Köppe, Christopher Thomas Ryan, Maurice Queyranne. ior, 59(6):1445-1460, 2011. [doi]

2010

Separation, dimension, and facet algorithms for node flow polyhedraMaren Martens, S. Thomas McCormick, Maurice Queyranne. mp, 124(1-2):317-348, 2010. [doi]

Minimizing the sum of weighted completion times in a concurrent open shopMonaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan. orl, 38(5):390-395, 2010. [doi]

2009

2008

Batch processing with interval graph compatibilities between tasksGerd Finke, Vincent Jost, Maurice Queyranne, András Sebö. DAM, 156(5):556-568, 2008. [doi]

Dynamic Multipriority Patient Scheduling for a Diagnostic ResourceJonathan Patrick, Martin L. Puterman, Maurice Queyranne. ior, 56(6):1507-1525, 2008. [doi]

Sublattices of product spaces: Hulls, representations and countingMaurice Queyranne, Fabio Tardella. DM, 308(9):1508-1523, 2008. [doi]

2007

Clique partitioning of interval graphs with submodular costs on the cliquesDion Gijswijt, Vincent Jost, Maurice Queyranne. rairo, 41(3):275-287, 2007. [doi]

2006

2004

Submodular function minimization in ::::I:::: and searching in Monge arraysMaurice Queyranne. endm, 17:5, 2004. [doi]

Submodular Function Minimization in Zeta:::n::: and Searching in Monge arraysMaurice Queyranne. colognetwente 2004: 13

2003

Minimizing a Convex Cost Closure SetDorit S. Hochbaum, Maurice Queyranne. siamdm, 16(2):192-207, 2003. [doi]

Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling ProblemFranÃ§ois Margot, Maurice Queyranne, Yaoguang Wang. ior, 51(6):981-992, 2003. [doi]

2002

Single Machine Scheduling with Release DatesMichel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang. siamdm, 15(2):165-192, 2002. [doi]

A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objectiveMaurice Queyranne, Maxim Sviridenko. jal, 45(2):202-212, 2002. [doi]

Production and Inventory Model Using Net Present ValueDaning Sun, Maurice Queyranne. ior, 50(3):528-537, 2002. [doi]

2001

The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release DatesCheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi. ipco 2001: 45-59 [doi]

A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum ObjectiveMaurice Queyranne, Maxim Sviridenko. ipco 2001: 361-369 [doi]

2000

Minimizing a Convex Cost Closure SetDorit S. Hochbaum, Maurice Queyranne. esa 2000: 256-267

New and improved algorithms for minsum shop schedulingMaurice Queyranne, Maxim Sviridenko. soda 2000: 871-878 [doi]

1999

1998

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling ProblemsAlix Munier, Maurice Queyranne, Andreas S. Schulz. ipco 1998: 367-382 [doi]

Minimizing symmetric submodular functionsMaurice Queyranne. mp, 82:3-12, 1998.

A General Class of Greedily Solvable Linear ProgramsMaurice Queyranne, Frits C. R. Spieksma, Fabio Tardella. mor, 23(4):892-908, 1998. [doi]

1997

PrefaceRainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne. anor, 69, 1997. [doi]

Approximation Algorithms for Multi-index Transportation Problems with Decomposable CostsMaurice Queyranne, Frits C. R. Spieksma. DAM, 76(1-3):239-253, 1997. [doi]

1996

On the Two-Level Uncapacitated Facility Location ProblemKaren Aardal, Martine LabbÃ©, Janny Leung, Maurice Queyranne. informs, 8(3):289-301, 1996. [doi]

A feedback strategy for periodic network flowsFranco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich. networks, 27(1):25-34, 1996. [doi]

Single Resource Multi-Item Inventory SystemsGuillermo Gallego, Maurice Queyranne, David Simchi-Levi. ior, 44(4):580-595, 1996. [doi]

Disconnecting sets in single and two-terminal-pair networksFrieda Granot, Michal Penn, Maurice Queyranne. networks, 27(2):117-123, 1996. [doi]

PrefaceAlain Hertz, Maurice Queyranne, Marino Widmer. DAM, 65(1-3):1-3, 1996. [doi]

1995

1993

The Performance Ratio of Grouping Policies for the Joint Replenishment ProblemMaurice Queyranne, Daning Sun. DAM, 46(1):43-72, 1993. [doi]

Hamiltonian path and symmetric travelling salesman polytopesMaurice Queyranne, Yaoguang Wang. mp, 58:89-110, 1993.

Structure of a simple scheduling polyhedronMaurice Queyranne. mp, 58:263-285, 1993.

A general class of greedily solvable linear programsMaurice Queyranne, Frits C. R. Spieksma, Fabio Tardella. ipco 1993: 385-399

1992

Lot Sizing Policies for Finite Production Rate Assembly SystemsDerek Atkins, Maurice Queyranne, Daning Sun. ior, 40(1):126-141, 1992. [doi]

Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine SchedulingJean B. Lasserre, Maurice Queyranne. ipco 1992: 136-149

On the convex hull of feasible solutions to certain combinatorial problemsMaurice Queyranne, Yaoguang Wang. orl, 11(1):1-11, 1992. [doi]

1991

Cut-threshold graphsPeter L. Hammer, Frédéric Maffray, Maurice Queyranne. DAM, 30(2-3):163-179, 1991. [doi]

Single-Machine Scheduling Polyhedra with Precedence ConstraintsMaurice Queyranne, Yaoguang Wang. mor, 16(1):1-20, 1991. [doi]

1985

Bounds for Assembly Line Balancing HeuristicsMaurice Queyranne. ior, 33(6):1353-1359, 1985. [doi]

1984

Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95Maurice Queyranne. networks, 14(1):174-175, 1984. [doi]

1982

On Dynamic Programming Methods for Assembly Line BalancingEdward P. C. Kao, Maurice Queyranne. ior, 30(2):375-390, 1982. [doi]

A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theoryJean-Claude Picard, Maurice Queyranne. networks, 12(2):141-159, 1982. [doi]

On the structure of all minimum cuts in a network and applicationsJean-Claude Picard, Maurice Queyranne. mp, 22(1):121, 1982. [doi]

1981

On the One-Dimensional Space Allocation ProblemJean-Claude Picard, Maurice Queyranne. ior, 29(2):371-391, 1981. [doi]

1980

Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow ProblemMaurice Queyranne. mor, 5(2):258-266, 1980. [doi]

1978

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine SchedulingJean-Claude Picard, Maurice Queyranne. ior, 26(1):86-110, 1978. [doi]

Letter to the Editor - On "A 'Hard' Assignment Problem" by Machol and WienMaurice Queyranne. ior, 26(2):376, 1978. [doi]

1977

On the integer-valued variables in the linear vertex packing problemJean-Claude Picard, Maurice Queyranne. mp, 12(1):97-101, 1977. [doi]

Le Problème du voyageur de commerce à coûts variables et quelques applicationsMaurice Queyranne. PhD thesis, Joseph Fourier University, Grenoble, France, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL