Pages that link to "Item:Q4530641"

The following pages link to On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Q4530641):

Displaying 50 items.

• An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
• Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
• Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation (Q322947) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
• Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
• Optimized load planning for motorail transportation (Q342294) (← links)
• A branch and price approach for deployment of multi-tier software services in clouds (Q342499) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
• Elective course planning (Q420895) (← 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)
• Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• Branching in branch-and-price: A generic scheme (Q652288) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• Composite-variable modeling for service parts logistics (Q867536) (← links)
• Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem (Q969750) (← links)
• A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
• A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• A framework for collaborative planning and state-of-the-art (Q1017944) (← links)
• On column generation formulations for the RWA problem (Q1025995) (← links)
• A unified approach for price directive decomposition procedures in integer programming (Q1109677) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• Branch-and-price algorithm for fuzzy integer programming problems with block angular structure (Q1677927) (← links)
• Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (Q1699130) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
• Dantzig-Wolfe and Lagrangian decompositions in integer linear programming (Q1758875) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Multi-period traffic routing in satellite networks (Q1926695) (← links)
• A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
• A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing (Q2027048) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
• Dynamic location of modular manufacturing facilities with relocation of individual modules (Q2184138) (← links)
• A graph partitioning strategy for solving large-scale crew scheduling problems (Q2260895) (← links)
• A column generation approach to multiscale capacity planning for power-intensive process networks (Q2302360) (← links)
• Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
• Scheduling trainees at a hospital department using a branch-and-price approach (Q2432850) (← links)