Skip to search formSkip to main contentSkip to account menu

Branch and price

In applied mathematics, branch and price is a method of combinatorial optimization for solving integer linear programming (ILP) and mixed integer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Branch and boundBranch and cutGeneralized assignment problemGraph coloring

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Scalable and efficient configuration of time-division multiplexed resources
2015
2015
Two exact algorithms for the traveling umpire problem
2014
2014
A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems
We address two two-dimensional bin packing problems where the bins are rectangular and have the same size. The items are also… 
2012
2012
Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility
This paper proposes an abstraction of emerging vehicle routing problems, the Vehicle Routing Problem with Black Box Feasibility… 
2012
2012
Reload cost trees and network design
In this article, we consider the notion of “reload costs” in network design. Reload costs occur naturally in many different… 
2012
2012
A logistics network design model with vendor managed inventory
2010
2010
Solving survivable two-layer network design problems by metric inequalities
We address the problem of designing a multi-layer network with survivability requirements. We are given a two-layer network: the… 
2006
2006
A multi-commodity flow approach for globally aware routing in multi-hop wireless networks
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes… 
2005
2005
An exact algorithm for Aircraft Landing Problem
This paper addresses the problem of scheduling aircraft landings at an airport. Given a set of planes and runways, the objective… 
2001
2001
Sorting Permutations by Reversals Through Branch-and-Price
We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)