Pages that link to "Item:Q652288"

The following pages link to Branching in branch-and-price: A generic scheme (Q652288):

Displaying 43 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)
• All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
• Column generation approaches for the software clustering problem (Q301694) (← 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)
• Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
• On column generation formulations for the RWA problem (Q1025995) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
• A branch-and-price algorithm for the aperiodic multi-period service scheduling problem (Q1694820) (← links)
• Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem (Q2076890) (← links)
• Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
• Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
• A column generation approach to multiscale capacity planning for power-intensive process networks (Q2302360) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• An integer optimality condition for column generation on zero-one linear programs (Q2419361) (← links)
• Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
• Constraint-specific recovery network for solving airline recovery problems (Q2654390) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
• A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (Q2830951) (← links)
• Column Generation based Primal Heuristics (Q2883638) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
• Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• From High-Level Model to Branch-and-Price Solution in G12 (Q5387632) (← links)
• Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)
• Two extended formulations for the virtual network function placement and routing problem (Q6179721) (← links)