Pages that link to "Item:Q5322154"

The following pages link to Selected Topics in Column Generation (Q5322154):

Displaying 50 items.

• Robustness analysis of elementary flux modes generated by column generation (Q254086) (← links)
• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
• All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
• Two exact algorithms for the traveling umpire problem (Q319246) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• A branch and price approach for routing and refueling station location model (Q320784) (← links)
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
• A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem (Q331982) (← links)
• Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
• A hybrid column generation with GRASP and path relinking for the network load balancing problem (Q336721) (← links)
• Liner shipping network design with deadlines (Q336778) (← links)
• A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
• A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Large-scale pickup and delivery work area design (Q339655) (← links)
• An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges (Q339664) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
• A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
• Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem (Q342548) (← links)
• Iterative estimation maximization for stochastic linear programs with conditional value-at-risk constraints (Q395689) (← links)
• A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts (Q398875) (← links)
• Modelling weak disposability in data envelopment analysis under relaxed convexity assumptions (Q418076) (← links)
• A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
• Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
• Analysis of programming properties and the row-column generation method for 1-norm support vector machines (Q460673) (← links)
• Sustainable vegetable crop supply problem with perishable stocks (Q475237) (← links)
• Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
• A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• On minimum reload cost cycle cover (Q496639) (← links)
• On dynamically generating relevant elementary flux modes in a metabolic network using optimization (Q500343) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• On the cutting stock problem under stochastic demand (Q610975) (← links)
• A note on branch-and-cut-and-price (Q613321) (← links)
• An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse (Q613357) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
• A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Total flow time minimization in a flowshop sequence-dependent group scheduling problem (Q733546) (← links)