Keyword: programming: branch and bound

Found 862 papers in total
Heuristics for the two-machine scheduling problem with a single server
Heuristics for the two-machine scheduling problem with a single server
2017,
In this paper, the NP‐hard two‐machine scheduling problem with a single...
On learning and branching: a survey
On learning and branching: a survey
2017,
This paper surveys learning techniques to deal with the two most crucial decisions in...
Exact and Heuristic Algorithms for Risk-Aware Stochastic Physical Search
Exact and Heuristic Algorithms for Risk-Aware Stochastic Physical Search
2017,
We consider an intelligent agent seeking to obtain an item from one of several...
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
2017,
The quadratic assignment problem (QAP) is a combinatorial optimization problem that...
Guided dive for the spatial branch-and-bound
Guided dive for the spatial branch-and-bound
2017,
We study the spatial Brand‐and‐Bound algorithm for the global...
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
2017,
Given a set of candidate road projects associated with costs, finding the best subset...
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
2017,
We study the knapsack problem with conflict graph (KPCG), an extension of the...
Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem
Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem
2017,
The resolution of integer programming problems is typically performed via branch and...
A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste
A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste
2017,
This paper proposes a hybrid approach for solving the multi‐objective model...
Linear transformation based solution methods for non-convex mixed integer quadratic programs
Linear transformation based solution methods for non-convex mixed integer quadratic programs
2017,
Two preprocessing techniques for mixed integer quadratic programs with...
A branch and efficiency algorithm for the optimal design of supply chain networks
A branch and efficiency algorithm for the optimal design of supply chain networks
2017,
Supply chain operations directly affect service levels. Decision on amendment of...
Method of Digraphs for Multi-dimensional Screening
Method of Digraphs for Multi-dimensional Screening
2017,
We study a general model of multi‐dimensional screening for discrete types of...
Improved approaches to the exact solution of the machine covering problem
Improved approaches to the exact solution of the machine covering problem
2017,
For the basic problem of scheduling a set of n independent jobs on a set of m...
Cyclic best first search: Using contours to guide branch-and-bound algorithms
Cyclic best first search: Using contours to guide branch-and-bound algorithms
2017,
The cyclic best‐first search (CBFS) strategy is a recent search strategy that...
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
2017,
We propose a two‐stage stochastic programming framework for designing or...
A Machine Learning-Based Approximation of Strong Branching
A Machine Learning-Based Approximation of Strong Branching
2017,
We present in this paper a new generic approach to variable branching in branch and...
Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing
2016,
The open‐pit mine block sequencing problem (OPBS) models a deposit of ore and...
Improving Websites' Quality of Service by Shortening Their Browsing Expected Path Length
Improving Websites' Quality of Service by Shortening Their Browsing Expected Path Length
2016,
This work proposes a method to improve the QoS provided to internet users by website...
Technical Note–Trading Off Quick versus Slow Actions in Optimal Search
Technical Note–Trading Off Quick versus Slow Actions in Optimal Search
2015,
We consider the search for a target whose precise location is uncertain. The search...
Benders Decomposition for Production Routing Under Demand Uncertainty
Benders Decomposition for Production Routing Under Demand Uncertainty
2015,
The production routing problem (PRP) is a generalization of the inventory routing...
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
2016,
We consider the two‐level uncapacitated facility location problem with...
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
2017,
Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a...
An optimal algorithm for Global Optimization and adaptive covering
An optimal algorithm for Global Optimization and adaptive covering
2016,
The general class of zero‐order Global Optimization problems is split into...
Finding optimal tour schedules on transportation paths under extended time window constraints
Finding optimal tour schedules on transportation paths under extended time window constraints
2016,
This paper addresses time‐critical routing on a given path under release dates...
Papers per page: