Pages that link to "Item:Q2770133"
From MaRDI portal
The following pages link to Branch-and-Price: Column Generation for Solving Huge Integer Programs (Q2770133):
Displaying 50 items.
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
- A discrete meta-control procedure for approximating solutions to binary programs (Q280551) (← links)
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
- A mixed integer programming approach to multi-skilled workforce scheduling (Q283273) (← links)
- Workforce scheduling and routing problems: literature survey and computational study (Q284388) (← links)
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery (Q319010) (← links)
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357) (← 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)
- Scheduling pumpoff operations in onshore oilfields under electric-power constraints (Q320129) (← links)
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- Decomposition approaches for recoverable robust optimization problems (Q322768) (← links)
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation (Q322947) (← links)
- A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
- Scheduling cranes at an indented berth (Q323166) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Maximizing expected number of transplants in kidney exchange programs (Q325460) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- A multilevel integrative approach to hospital case mix and capacity planning (Q336475) (← links)
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Optimal shift partitioning of pharmacies (Q337411) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation (Q337610) (← links)
- A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
- Optimized load planning for motorail transportation (Q342294) (← links)
- A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← 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)
- Elective course planning (Q420895) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
