Pages that link to "Item:Q1360108"

The following pages link to An exact algorithm for IP column generation (Q1360108):

Displaying 50 items.

• The shortest path problem with forbidden paths (Q146692) (← links)
• An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
• Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation (Q322947) (← links)
• A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
• A branch and price approach for deployment of multi-tier software services in clouds (Q342499) (← 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)
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• The generalized fixed-charge network design problem (Q856677) (← links)
• Composite-variable modeling for service parts logistics (Q867536) (← links)
• A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408) (← links)
• Pruning in column generation for service vehicle dispatching (Q940899) (← links)
• Exact algorithms for the matrix bid auction (Q958442) (← links)
• Group-scheduling problems in electronics manufacturing (Q964869) (← links)
• Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem (Q969750) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
• Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
• Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
• A generalized linear programming model for nurse scheduling (Q1296052) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
• A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals (Q1753439) (← links)
• Fleet assignment and routing with schedule synchronization constraints (Q1806762) (← links)
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Multi-period traffic routing in satellite networks (Q1926695) (← links)
• Computational study of a column generation algorithm for bin packing and cutting stock problems (Q1970365) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling (Q2257354) (← links)
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
• Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
• Solving a dial-a-flight problem using composite variables (Q2307323) (← links)
• A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← links)
• Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
• Scheduling trainees at a hospital department using a branch-and-price approach (Q2432850) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• Comparison of bundle and classical column generation (Q2476993) (← links)
• A branch-and-price approach for integrating nurse and surgery scheduling (Q2482743) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• Branch-and-price: Column generation for solving huge integer programs (Q2770133) (← links)
• Column generation for a UAV assignment problem with precedence constraints (Q2903993) (← links)