The following pages link to Stefan Voß (Q251165):
Displaying 50 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
- Optimal capacitated ring trees (Q286687) (← links)
- Integrating deterioration and lifetime constraints in production and supply chain planning: a survey (Q296854) (← links)
- An exact algorithm for the reliability redundancy allocation problem (Q319293) (← links)
- An improved mathematical formulation for the blocks relocation problem (Q319595) (← links)
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- Improved load balancing and resource utilization for the skill vehicle routing problem (Q395849) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- A mathematical formulation and complexity considerations for the blocks relocation problem (Q439616) (← links)
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs (Q518138) (← links)
- Applying the corridor method to a blocks relocation problem (Q657049) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time (Q723919) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← links)
- Simple heuristics for scheduling with limited intermediate storage (Q868994) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- Experiments concerning sequential versus simultaneous maximization of objective function and distance (Q1009194) (← links)
- A reference model for customer-centric data mining with support vector machines (Q1042173) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- The Steiner tree problem with hop constraints (Q1290154) (← links)
- Applications of modern heuristic search methods to pattern sequencing problems (Q1302706) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- A case study in empty railcar distribution (Q1390331) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
- Container terminal operation and operations research -- a classification and literature review (Q1424374) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- A discrete-binary transformation of the reliability redundancy allocation problem (Q1665203) (← links)
- Solving the robust container pre-marshalling problem (Q1680086) (← links)
- Impact on yard efficiency of a truck appointment system for a port terminal (Q1686486) (← links)
- Stochastic programming for global supply chain planning under uncertainty: an outline (Q1691695) (← links)
- Reducing airport emissions with coordinated pushback processes: a case study (Q1691713) (← links)
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- An efficient ant colony optimization algorithm for the blocks relocation problem (Q1755234) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Exercises book on operations research (Q1909268) (← links)
- Dynamic tabu search strategies for the traveling purchaser problem (Q1919843) (← links)
- Schoenberg correspondence on dual groups (Q2016052) (← links)
- Modeling the capacitated \(p\)-cable trench problem with facility costs (Q2045638) (← links)
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
- A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals (Q2163853) (← links)
- Chunking and cooperation in particle swarm optimization for feature selection (Q2163857) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
