The following pages link to Column Generation (Q5316721):
Displaying 50 items.
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Temporal linear relaxation in IBM ILOG CP optimizer (Q309055) (← links)
- Two exact algorithms for the traveling umpire problem (Q319246) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- A column generation approach for locating roadside clinics in Africa based on effectiveness and equity (Q323452) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- A hybrid column generation with GRASP and path relinking for the network load balancing problem (Q336721) (← links)
- The concrete delivery problem (Q337044) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
- Large-scale pickup and delivery work area design (Q339655) (← links)
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- Modeling and solving profitable location and distribution problems (Q375987) (← links)
- Designing WDM optical networks using branch-and-price (Q387309) (← links)
- Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
- A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts (Q398875) (← links)
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- Speeding up column generation for robust wireless network planning (Q743642) (← links)
- A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- A column generation approach for the rail crew re-scheduling problem (Q869160) (← links)
- A column-generation approach for joint mobilization and evacuation planning (Q890000) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Performances improvement of the column generation algorithm: application to vehicle routing problems (Q989834) (← links)
- A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks (Q992709) (← links)
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
- A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← 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)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles (Q1040998) (← links)
- Improving blood products supply through donation tailoring (Q1628111) (← links)
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
- Tramp ship routing and scheduling with voyage separation requirements (Q1642055) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
