The following pages link to Ulrich Derigs (Q340252):
Displaying 50 items.
- Truck and trailer routing -- problems, heuristics and computational experience (Q340255) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
- On a local-search heuristic for a class of tracking error minimization problems in portfolio management (Q702711) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- (Q798563) (redirect page) (← links)
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564) (← links)
- O\&D revenue management in cargo airlines-a mathematical programming approach (Q858605) (← links)
- A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem (Q991840) (← links)
- Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation (Q1017968) (← links)
- On the application of a transportation model for revenue optimization in waste management: a case study (Q1022408) (← links)
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions (Q1062913) (← links)
- On the use of optimal fractional matchings for solving the (integer) matching problem (Q1068525) (← links)
- An efficient labeling technique for solving sparse assignment problems (Q1071650) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- Monge sequences and a simple assignment algorithm (Q1104243) (← links)
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective (Q1133463) (← links)
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis (Q1141079) (← links)
- Efficiency and time-cost-tradeoffs in transportation problems (Q1169400) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms (Q1210806) (← links)
- An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
- An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
- An efficient matching algorithm applied in statistical physics (Q1331902) (← links)
- Genetic modeling of artificial neural nets. An application to credit evaluation (Q1374813) (← links)
- Meta-heuristic based decision support for portfolio optimization with a case study on tracking error minimization in passive portfolio management (Q1402429) (← links)
- A gA-based decision support system for professional course scheduling at ford service organisation (Q1764204) (← links)
- Air cargo scheduling: integrated models and solution procedures (Q1944877) (← links)
- Indirect search for the vehicle routing problem with pickup and delivery and time windows (Q2480796) (← links)
- Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation (Q2840788) (← links)
- Duality and admissible transformations in combinatorial optimization (Q3048583) (← links)
- Matching problems with generalized upper bound side constraints (Q3204346) (← links)
- (Q3309451) (← links)
- (Q3320126) (← links)
- On three basic methods for solving bottleneck transportation problems (Q3657782) (← links)
- (Q3661316) (← links)
- An analysis of alternative strategies for implementing matching algorithms (Q3668867) (← links)
- (Q3678967) (← links)
- (Q3688103) (← links)
- Using Confidence Limits for the Global Optimum in Combinatorial Optimization (Q3714898) (← links)
- A short note on matching algorithms (Q3716816) (← links)
- (Q3750518) (← links)
- An in-core/out-of-core method for solving large scale assignment problems (Q3763916) (← links)
- Solving large-scale matching problems efficiently: A new primal matching approach (Q3786301) (← links)
- (Q3875697) (← links)
- (Q3888876) (← links)
- (Q3911687) (← links)
- (Q3921015) (← links)
- (Q3921016) (← links)
- Admissible Transformations and their Application to Matching Problems (Q3923972) (← links)
- A shortest augmenting path method for solving minimal perfect matching problems (Q3931440) (← links)
