The following pages link to Maurice Queyranne (Q423918):
Displayed 50 items.
- The interval ordering problem (Q423919) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- (Q628305) (redirect page) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- The performance ratio of grouping policies for the joint replenishment problem (Q689953) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- On finding the K best cuts in a network (Q792224) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective: A correction (Q880571) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776) (← links)
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience (Q1146121) (← links)
- On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling (Q1744895) (← links)
- Largest minimal inversion-complete and pair-complete sets of permutations (Q1747991) (← links)
- Structure of a simple scheduling polyhedron (Q1803611) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Cut-threshold graphs (Q2277496) (← links)
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups (Q2364487) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Sublattices of product spaces: Hulls, representations and counting (Q2477376) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
- (Q2753941) (← links)
- A General Class of Greedily Solvable Linear Programs (Q2757571) (← links)
- Single Machine Scheduling with Release Dates (Q2784510) (← links)
- Appointment Scheduling with Discrete Random Durations (Q2884273) (← links)
- Rational Generating Functions and Integer Programming Games (Q2893918) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- (Q3061959) (← links)
- Toward Robust Revenue Management: Competitive Analysis of Online Booking (Q3100400) (← links)
- (Q3115718) (← links)
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost (Q3120568) (← links)
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions (Q3391992) (← links)
- Dynamic Multipriority Patient Scheduling for a Diagnostic Resource (Q3392268) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Optimal pits and optimal transportation (Q3460391) (← links)
- Production and Inventory Model Using Net Present Value (Q3635113) (← links)
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem (Q3637403) (← links)
- (Q3683848) (← links)
- Bounds for Assembly Line Balancing Heuristics (Q3703644) (← links)
- (Q3758553) (← links)
- Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions” (Q3768683) (← links)