COMMENT ON "A DYNAMIC PROGRAMMING ALGORITHM FOR JOINT REPLENISHMENT UNDER GENERAL ORDER COST FUNCTIONS"
- Published in:
- Management Science, 1987, v. 33, n. 1, p. 131, doi. 10.1287/mnsc.33.1.131
- By:
- Publication type:
- Article
Works matching AU Queyranne, Maurice
Results: 38
1
2
BUDGETING COSTS OF NURSING IN A HOSPITAL.
- Published in:
- Management Science, 1985, v. 31, n. 5, p. 608, doi. 10.1287/mnsc.31.5.608
- By:
- Publication type:
- Article
3
Technical Note--A Sampling-Based Approach to Appointment Scheduling.
- Published in:
- Operations Research, 2012, v. 60, n. 3, p. 675, doi. 10.1287/opre.1120.1053
- By:
- Publication type:
- Article
4
Rational Generating Functions and Integer Programming Games.
- Published in:
- Operations Research, 2011, v. 59, n. 6, p. 1445, doi. 10.1287/opre.1110.0964
- By:
- Publication type:
- Article
5
Toward Robust Revenue Management: Competitive Analysis of Online Booking.
- Published in:
- Operations Research, 2009, v. 57, n. 4, p. 950, doi. 10.1287/opre.1080.0654
- By:
- Publication type:
- Article
6
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource.
- Published in:
- Operations Research, 2008, v. 56, n. 6, p. 1507, doi. 10.1287/opre.1080.0590
- By:
- Publication type:
- Article
7
On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions.
- Published in:
- Operations Research, 2006, v. 54, n. 3, p. 464, doi. 10.1287/opre.1060.0270
- By:
- Publication type:
- Article
8
PRODUCTION AND INVENTOR MODEL USING NET PRESENT VALUE.
- Published in:
- Operations Research, 2002, v. 50, n. 3, p. 528, doi. 10.1287/opre.50.3.528.7744
- By:
- Publication type:
- Article
9
SELECTED APPLICATIONS OF MINIMUM CUTS IN NETWORKS.
- Published in:
- INFOR, 1982, v. 20, n. 4, p. 394, doi. 10.1080/03155986.1982.11731876
- By:
- Publication type:
- Article
10
A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling.
- Published in:
- Computational Optimization & Applications, 2018, v. 69, n. 2, p. 501, doi. 10.1007/s10589-017-9946-1
- By:
- Publication type:
- Article
11
Preface.
- Published in:
- 1997
- By:
- Publication type:
- Book Chapter
12
Tight MIP formulations for bounded up/down times and interval-dependent start-ups.
- Published in:
- Mathematical Programming, 2017, v. 164, n. 1/2, p. 129, doi. 10.1007/s10107-016-1079-2
- By:
- Publication type:
- Article
13
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
- Published in:
- Mathematical Programming, 2015, v. 154, n. 1/2, p. 3, doi. 10.1007/s10107-015-0944-8
- By:
- Publication type:
- Article
14
Structural and algorithmic properties for parametric minimum cuts.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 337, doi. 10.1007/s10107-011-0463-1
- By:
- Publication type:
- Article
15
Separation, dimension, and facet algorithms for node flow polyhedra.
- Published in:
- Mathematical Programming, 2010, v. 124, n. 1/2, p. 317, doi. 10.1007/s10107-010-0378-2
- By:
- Publication type:
- Article
16
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates.
- Published in:
- Mathematical Programming, 2006, v. 106, n. 1, p. 137, doi. 10.1007/s10107-005-0588-1
- By:
- Publication type:
- Article
17
Disconnecting sets in single and two-terminal-pair networks.
- Published in:
- Networks, 1996, v. 27, n. 2, p. 117, doi. 10.1002/(SICI)1097-0037(199603)27:2<117::AID-NET3>3.0.CO;2-N
- By:
- Publication type:
- Article
18
A feedback strategy for periodic network flows.
- Published in:
- Networks, 1996, v. 27, n. 1, p. 25, doi. 10.1002/(SICI)1097-0037(199601)27:1<25::AID-NET3>3.0.CO;2-G
- By:
- Publication type:
- Article
19
Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 174, doi. 10.1002/net.3230140115
- By:
- Publication type:
- Article
20
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory.
- Published in:
- Networks, 1982, v. 12, n. 2, p. 141, doi. 10.1002/net.3230120206
- By:
- Publication type:
- Article
21
INTRODUCTION.
- Published in:
- Annals of Operations Research, 1990, v. 26, n. 1-4, p. 1, doi. 10.1007/BF02248582
- By:
- Publication type:
- Article
22
Cost‐raising internalization in supply chain design.
- Published in:
- Naval Research Logistics, 2021, v. 68, n. 3, p. 295, doi. 10.1002/nav.21951
- By:
- Publication type:
- Article
23
Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost.
- Published in:
- Naval Research Logistics, 2012, v. 59, n. 5, p. 384, doi. 10.1002/nav.21497
- By:
- Publication type:
- Article
24
On the asymptotic optimality of algorithms for the flow shop problem with release dates.
- Published in:
- Naval Research Logistics, 2005, v. 52, n. 3, p. 232, doi. 10.1002/nav.20066
- By:
- Publication type:
- Article
25
A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs.
- Published in:
- Naval Research Logistics, 1991, v. 38, n. 5, p. 729, doi. 10.1002/1520-6750(199110)38:5<729::AID-NAV3220380508>3.0.CO;2-U
- By:
- Publication type:
- Article
26
Appointment Scheduling with Discrete Random Durations.
- Published in:
- Mathematics of Operations Research, 2011, v. 36, n. 2, p. 240, doi. 10.1287/moor.1110.0489
- By:
- Publication type:
- Article
27
A GENERAL CLASS OF GREEDILY SOLVABLE LINEAR PROGRAMS.
- Published in:
- Mathematics of Operations Research, 1998, v. 23, n. 4, p. 892, doi. 10.1287/moor.23.4.892
- By:
- Publication type:
- Article
28
Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes.
- Published in:
- Mathematics of Operations Research, 1995, v. 20, n. 4, p. 838, doi. 10.1287/moor.20.4.838
- By:
- Publication type:
- Article
29
THEORETICAL EFFICIENCY OF THE ALGORITHM "CAPACITY" FOR THE MAXIMUM FLOW PROBLEM.
- Published in:
- Mathematics of Operations Research, 1980, v. 5, n. 2, p. 258, doi. 10.1287/moor.5.2.258
- By:
- Publication type:
- Article
30
OPTIMAL PITS AND OPTIMAL TRANSPORTATION.
- Published in:
- ESAIM: Mathematical Modelling & Numerical Analysis (ESAIM: M2AN), 2015, v. 49, n. 6, p. 1659, doi. 10.1051/m2an/2015026
- By:
- Publication type:
- Article
31
Single resource multi-item inventory systems.
- Published in:
- Operations Research, 1996, v. 44, n. 4, p. 580, doi. 10.1287/opre.44.4.580
- By:
- Publication type:
- Article
32
LOT SIZING POLICIES FOR FINITE PRODUCTION RATE ASSEMBLY SYSTEMS.
- Published in:
- Operations Research, 1992, v. 40, n. 1, p. 126, doi. 10.1287/opre.40.1.126
- By:
- Publication type:
- Article
33
Bounds for Assembly Line Balancing Heuristics.
- Published in:
- Operations Research, 1985, v. 33, n. 6, p. 1353, doi. 10.1287/opre.33.6.1353
- By:
- Publication type:
- Article
34
On Dynamic Programming Methods for Assembly Line Balancing.
- Published in:
- Operations Research, 1982, v. 30, n. 2, p. 375, doi. 10.1287/opre.30.2.375
- By:
- Publication type:
- Article
35
On the One-Dimensional Space Allocation Problem.
- Published in:
- Operations Research, 1981, v. 29, n. 2, p. 371, doi. 10.1287/opre.29.2.371
- By:
- Publication type:
- Article
36
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 86, doi. 10.1287/opre.26.1.86
- By:
- Publication type:
- Article
37
Combinatorial approach to inference in partially identified incomplete structural models.
- Published in:
- Quantitative Economics, 2015, v. 6, n. 2, p. 499, doi. 10.3982/QE377
- By:
- Publication type:
- Article
38
IN MEMORIAM Jean-Claude Picard (1938-1999).
- Published in:
- 2004
- By:
- Publication type:
- Editorial