Maurice Queyranne

5.0k total citations
94 papers, 3.0k citations indexed

About

Maurice Queyranne is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Maurice Queyranne has authored 94 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Industrial and Manufacturing Engineering, 34 papers in Computer Networks and Communications and 29 papers in Computational Theory and Mathematics. Recurrent topics in Maurice Queyranne's work include Scheduling and Optimization Algorithms (32 papers), Optimization and Search Problems (30 papers) and Advanced Graph Theory Research (18 papers). Maurice Queyranne is often cited by papers focused on Scheduling and Optimization Algorithms (32 papers), Optimization and Search Problems (30 papers) and Advanced Graph Theory Research (18 papers). Maurice Queyranne collaborates with scholars based in Canada, United States and France. Maurice Queyranne's co-authors include Jean‐Claude Picard, Mehmet A. Begen, Martin L. Puterman, Jonathan Patrick, Andreas S. Schulz, Yaoguang Wang, Michael O. Ball, Jon Lee, Edward P. C. Kao and David Simchi‐Levi and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Maurice Queyranne

92 papers receiving 2.8k citations

Peers

Countries citing papers authored by Maurice Queyranne

Since Specialization

Citations

This map shows the geographic impact of Maurice Queyranne's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Maurice Queyranne with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Maurice Queyranne more than expected).

Fields of papers citing papers by Maurice Queyranne

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Maurice Queyranne. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Maurice Queyranne. The network helps show where Maurice Queyranne may publish in the future.

Co-authorship network of co-authors of Maurice Queyranne

This figure shows the co-authorship network connecting the top 25 collaborators of Maurice Queyranne. A scholar is included among the top collaborators of Maurice Queyranne based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Maurice Queyranne. Maurice Queyranne is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Optimum turn-restricted paths, nested compatibility, and optimum convex polygons 2018 ·Journal of Combinatorial Optimization ·Maurice Queyranne, Laurence A. Wolsey	1
2	Properties of optimal schedules in preemptive shop scheduling 2010 ·Discrete Applied Mathematics ·(unknown), Jacques Carlier, Alexander Kononov, Maurice Queyranne, (unknown), M.N. Sviridenko	13
3	Appointment scheduling with discrete random durations 2009 ·Symposium on Discrete Algorithms ·Mehmet A. Begen, Maurice Queyranne	93
4	Polyhedral Approaches to Machine Scheduling 2008 ·Maurice Queyranne, Andreas S. Schulz	67
5	Batch processing with interval graph compatibilities between tasks 2007 ·Discrete Applied Mathematics ·Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö	39
6	On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions 2006 ·Operations Research ·Mabel C. Chou, (unknown), Maurice Queyranne, David Simchi‐Levi	34
7	Batch Processing with Interval Graph Compatibilities between tasks 2005 ·HAL (Le Centre pour la Communication Scientifique Directe) ·(unknown), Vincent Jost, Maurice Queyranne, (unknown)	0
8	Bimonotone linear inequalities and sublattices of Rn 2005 ·Linear Algebra and its Applications ·Maurice Queyranne, Fabio Tardella	10
9	Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem 2003 ·Operations Research ·François Margot, Maurice Queyranne, Yaoguang Wang	33
10	New and improved algorithms for minsum shop scheduling 2000 ·Symposium on Discrete Algorithms ·Maurice Queyranne, (unknown)	3
11	Approximation algorithms for multi-index transportation problems with decomposable costs 1997 ·Discrete Applied Mathematics ·Maurice Queyranne, Frits Spieksma	21
12	Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996 : proceedings 1996 ·Springer eBooks ·William H. Cunningham, S. Thomas McCormick, Maurice Queyranne	1
13	Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization 1996 ·William H. Cunningham, S. Thomas McCormick, Maurice Queyranne	4
14	A combinatorial algorithm for minimizing symmetric submodular functions 1995 ·Symposium on Discrete Algorithms ·Maurice Queyranne	30
15	On the Two-Level Uncapacitated Facility Location Problem 1994 ·Research portal (Tilburg University) ·Karen Aardal, Martine Labbé, Janny Leung, Maurice Queyranne	1
16	The performance ratio of grouping policies for the joint replenishment problem 1993 ·Discrete Applied Mathematics ·Maurice Queyranne, (unknown)	1
17	Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling 1992 ·DIAL (Catholic University of Leuven) ·Jean B. Lasserre, Maurice Queyranne	35
18	Cut-threshold graphs 1991 ·Discrete Applied Mathematics ·Peter L. Hammer, Frédéric Maffray, Maurice Queyranne	3
19	Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions” 1987 ·Management Science ·Maurice Queyranne	12
20	The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling 1978 ·Operations Research ·Jean‐Claude Picard, Maurice Queyranne	222

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact