• SCIP

• Referenced in 536 articles [sw01091]
• constraint integer programming and branch-cut-and-price. It allows for total control...

• ABACUS

• Referenced in 116 articles [sw02948]
• dynamically (branch-and-cut, branch-and-price, branch-and-cut-and-price). ABACUS allows ... list of different enumeration and branching strategies from which the best alternative for the user...

• DIP

• Referenced in 20 articles [sw09870]
• branch and cut, branch and price, branch and cut and price, subgradient-based Lagrangian relaxation...

• SYMPHONY

• Referenced in 36 articles [sw04718]
• Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving...

• GCG

• Referenced in 23 articles [sw10533]
• generic branch-cut-and-price solver for mixed integer programs. It is based ... branch-and-cut-and-price framework SCIP and is also part of the SCIP Optimization ... tree in the same way, transfers branching decisions and bound changes from the original problem...

• BaPCod

• Referenced in 19 articles [sw09871]
• reformulated problem is solved using a branch-and-price (column generation) algorithm. The specificity ... define master columns, their reduced cost, pricing problem, or Lagrangian bound; a default column generation ... specific subproblem solver; a branching scheme that preserves the pricing problem structure is offered...

• ALPS

• Referenced in 17 articles [sw00036]
• ALPS. The first is the Branch, Constrain, and Price Software (BiCePS) library, a framework that...

• CHiPPS

• Referenced in 14 articles [sw07210]
• Library for Parallel Search (ALPS) Branch, Constrain, and Price Software (BiCePS) BiCePS Linear Integer Solver...

• BiCePS

• Referenced in 9 articles [sw06321]
• ALPS. The first is the Branch, Constrain, and Price Software (BiCePS) library, a framework that...

• MINTO

• Referenced in 135 articles [sw04587]
• solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations ... inequalities perform variable fixing based on reduced prices control the size of the linear programs...

• COIN/BCP

• Referenced in 9 articles [sw12432]
• parallel framework for implementing branch, cut, and price algorithms for solving mixed integer programs (MIPs ... implementational effort. involved with implementing a branch and bound framework from scratch...

• SCIL

• Referenced in 10 articles [sw01099]
• that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs...

• NurseScheduler

• Referenced in 3 articles [sw33149]
• NurseScheduler: A branch and price algorithm to solve a nurse scheduling problem. The algorithm...

• UPPAAL CORA

• Referenced in 9 articles [sw25660]
• UPPAAL CORA is a branch of UPPAAL for Cost Optimal Reachability Anslysis developed ... modelling language, UPPAAL CORA uses linearly priced timed automata (LPTA). Given an LPTA model, UPPAAL...

• TinyOS

• Referenced in 7 articles [sw02023]
• power-efficient operation come at a price: TinyOS applications are notoriously difficult to construct, debug ... system under test and the particular branches chosen during each run. The toolkit supports comprehension...

• TSP Solver and Generator

• Referenced in 0 articles [sw05887]
• salesman problem” (TSP) tasks. It uses the Branch and Bound method for solving. Its input ... result is an optimal route, its price, step-by-step matrices of solving ... used as an example of using the Branch and Bound method to solve a particular...

• ODEA

• Referenced in 3 articles [sw07671]
• Planners needed a tool to support the pricing of so-called Virtual Private Networks ... encoding in our software. We devise a Branch-and-Bound scheme and fill...

• BARON

• Referenced in 354 articles [sw00066]
• BARON is a computational system for solving nonconvex...

• BPMPD

• Referenced in 41 articles [sw00088]
• BPMPD is a state-of-the-art implementation...

• CGAL

• Referenced in 384 articles [sw00118]
• The goal of the CGAL Open Source Project...