The following pages link to Jan Karel Lenstra (Q1329788):
Displaying 50 items.
- (Q706865) (redirect page) (← links)
- Linear programming models with planned lead times for supply chain operations planning (Q706867) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- New directions in scheduling theory (Q786649) (← links)
- A classification scheme for vehicle routing and scheduling problems (Q913648) (← links)
- Multiprocessor scheduling with communication delays (Q922681) (← links)
- Scheduling subject to resource constraints: Classification and complexity (Q1052820) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer (Q1253610) (← links)
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667) (← links)
- The mystical power of twoness: In memoriam Eugene L. Lawler (Q1268844) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
- A local search template. (Q1406708) (← links)
- Approximation algorithms for the test cover problem (Q1424310) (← links)
- Sequential and parallel local search for the time-constrained traveling salesman problem (Q1803676) (← links)
- Local search algorithms for the radio link frequency assignment problem (Q1854809) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- In memoriam Gerhard Woeginger (1964--2022) (Q2157912) (← links)
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428) (← links)
- Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
- (Q2760080) (← links)
- Computer-Aided Complexity Classification of Dial-a-Ride Problems (Q2890414) (← links)
- Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop (Q2890475) (← links)
- In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation (Q2952021) (← links)
- (Q3033585) (← links)
- (Q3035154) (← links)
- (Q3127425) (← links)
- (Q3206648) (← links)
- (Q3206662) (← links)
- (Q3206954) (← links)
- (Q3208408) (← links)
- (Q3217918) (← links)
- (Q3217922) (← links)
- (Q3221735) (← links)
- (Q3221759) (← links)
- Interval scheduling: A survey (Q3524590) (← links)
- Algorithms for Radio Link Frequency Assignment: The Calma Project (Q3635157) (← links)
- STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING (Q3678972) (← links)
- (Q3716814) (← links)
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation (Q3777787) (← links)
- (Q3783827) (← links)
- (Q3818133) (← links)
- (Q3824110) (← links)
- (Q3858002) (← links)
