The following pages link to Teodor Gabriel Crainic (Q210508):
Displaying 50 items.
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890) (← links)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
- Single source single-commodity stochastic network design (Q373182) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design (Q702717) (← links)
- Design for optimized multi-lateral multi-commodity markets (Q706897) (← links)
- A metaheuristic for stochastic service network design (Q707730) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
- A multilevel tabu search algorithm for the feature selection problem in biomedical data (Q929176) (← links)
- Service network design with management and coordination of multiple fleets (Q958079) (← links)
- Shortest path algorithms: A computational study with the C programming language (Q1184466) (← links)
- An interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations (Q1186005) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem (Q1606886) (← links)
- Global optimization properties of parallel cooperative search algorithms: A simulation study (Q1606888) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Simulation of intermodal freight transportation systems: a taxonomy (Q1651692) (← links)
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
- A revenue management approach for network capacity allocation of an intermodal barge transportation system (Q1680060) (← links)
- Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- The load planning problem for double-stack intermodal trains (Q1754216) (← links)
- Designing the master schedule for demand-adaptive transit systems (Q1761898) (← links)
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design (Q1771210) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
- Design issues for combinatorial auctions (Q1878992) (← links)
- A new bidding framework for combinatorial e-auctions (Q1885976) (← links)
- Models for bundle trading in financial markets (Q1887868) (← links)
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
- Single-commodity network design with random edge capacities (Q1926752) (← links)
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach (Q2027023) (← links)
- Scheduled service network design with quality targets and stochastic travel times (Q2028837) (← links)
- Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics (Q2029268) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Scheduled service network design with resource management for two-tier multimodal city logistics (Q2239992) (← links)
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
- Collaboration partner selection for city logistics planning under municipal freight regulations (Q2285998) (← links)
- Population-based risk equilibration for the multimode hazmat transport network design problem (Q2301954) (← links)
