The following pages link to Peter Brucker (Q177705):
Displaying 47 items.
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- (Q2734595) (← links)
- Engine scheduling by column generation (Q2740904) (← links)
- (Q2779816) (← links)
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints (Q3312019) (← links)
- (Q3318501) (← links)
- (Q3329200) (← links)
- (Q3332729) (← links)
- Pattern scheduling (Q3358511) (← links)
- (Q3416597) (← links)
- (Q3425131) (← links)
- Complex Scheduling (Q3511304) (← links)
- (Q3675893) (← links)
- (Q3682206) (← links)
- (Q3682270) (← links)
- A railway scheduling problem (Q3754429) (← links)
- (Q3912618) (← links)
- (Q3929043) (← links)
- (Q3942735) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- (Q4044376) (← links)
- (Q4055377) (← links)
- (Q4068425) (← links)
- (Q4071007) (← links)
- (Q4082533) (← links)
- (Q4124328) (← links)
- (Q4152035) (← links)
- (Q4170532) (← links)
- (Q4174530) (← links)
- (Q4181272) (← links)
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (Q4181574) (← links)
- (Q4181954) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- (Q4350045) (← links)
- (Q4396949) (← links)
- (Q4495168) (← links)
- (Q4553432) (← links)
- (Q4708562) (← links)
- A decomposition algorithm for shortest paths in a network with many strongly connected components (Q4772994) (← links)
- (Q4826104) (← links)
- (Q4859840) (← links)
- (Q4873242) (← links)
- A characterization of network representable polymatroids (Q5202490) (← links)
- (Q5650541) (← links)
- (Q5665021) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- Improving local search heuristics for some scheduling problems. II (Q5961605) (← links)
