Keyword: programming: branch and bound

Found 862 papers in total
A multi-objective transportation routing problem
A multi-objective transportation routing problem
2015,
This paper presents a variant of vehicle routing problem, incorporating factors of...
A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
2015,
In this paper, we consider the two‐machine permutation flowshop scheduling...
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm
2014,
In this article, we consider a variation of the vehicle routing problem arising in the...
A mathematical location-routing model of repair centres and ammunition depots in order to support soldiers in civil wars
A mathematical location-routing model of repair centres and ammunition depots in order to support soldiers in civil wars
2014,
One of the most crucial factors in civil wars is to properly support fighting...
A branch-and-bound algorithm for scheduling of new product development projects
A branch-and-bound algorithm for scheduling of new product development projects
2013,
In this paper, we consider scheduling problem in a new product development project....
Semidefinite relaxation for linear programs with equilibrium constraints
Semidefinite relaxation for linear programs with equilibrium constraints
2013,
In this paper, we present a semidefinite programming (SDP) relaxation for linear...
Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
2012,
Deteriorating jobs scheduling has received tremendous attention in the past two...
Determining the K-best solutions of knapsack problems
Determining the K-best solutions of knapsack problems
2014,
It is well‐known that knapsack problems arise as subproblems of a number of...
An access network design problem with end-to-end QoS constraints
An access network design problem with end-to-end QoS constraints
2014,
We describe a novel nonlinear MIP modeling approach for solving an access network...
Minimization of Sewage Network Overflow
Minimization of Sewage Network Overflow
2014,
We are interested in the optimal control of sewage networks. It is of high public...
Inclusion/Exclusion Meets Measure and Conquer
Inclusion/Exclusion Meets Measure and Conquer
2014,
Inclusion/exclusion and measure and conquer are two central techniques from the field...
Setting optimal due dates in a basic safe-scheduling model
Setting optimal due dates in a basic safe-scheduling model
2014,
We examine a basic stochastic sequencing model with due dates as decisions. The...
A branch-and-bound algorithm for the acyclic partitioning problem
A branch-and-bound algorithm for the acyclic partitioning problem
2014,
We focus on the problem of partitioning the vertex set of a directed, edge‐ and...
Branch‐reduction‐bound algorithm for generalized geometric programming
Branch‐reduction‐bound algorithm for generalized geometric programming
2013,
This article presents a branch‐reduction‐bound algorithm for globally...
Uncertain constrained optimization by interval‐oriented algorithm
Uncertain constrained optimization by interval‐oriented algorithm
2014,
This paper deals with an interval‐oriented approach to solve general interval...
Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine
Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine
2011,
This study deals with the problem of scheduling jobs on a single machine to minimize...
Branch and bound based solution algorithms for the budget constrained discrete time/cost trade‐off problem
Branch and bound based solution algorithms for the budget constrained discrete time/cost trade‐off problem
2013,
The time/cost trade‐off models in project management aim to reduce the...
A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch‐and‐bound algorithm
A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch‐and‐bound algorithm
2013,
In this paper, we consider the container transshipment problem at a railway hub. A...
Relax‐and‐fix decomposition technique for solving large scale grid‐based location problems
Relax‐and‐fix decomposition technique for solving large scale grid‐based location problems
2012,
Many problems in business, engineering, defence, resource exploitation, and even the...
Formulating and solving a multi‐mode resource‐collaboration and constrained scheduling problem (MRCCSP)
Formulating and solving a multi‐mode resource‐collaboration and constrained scheduling problem (MRCCSP)
2013,
The main motivation of this study is to provide, for the first time, a formulation and...
Biobjective planning of an active debris removal mission
Biobjective planning of an active debris removal mission
2013,
The growth of the orbital debris population has been a concern to the international...
Airport runway scheduling
Airport runway scheduling
2013,
Airport runway optimization is an ongoing challenge for air traffic controllers. Since...
A branch and bound algorithm for the response time variability problem
A branch and bound algorithm for the response time variability problem
2013,
The response time variability problem (RTVP) is an NP‐hard scheduling problem...
Shortest path problem with forbidden paths: The elementary version
Shortest path problem with forbidden paths: The elementary version
2013,
This paper addresses the elementary shortest path problem with forbidden paths. The...
Papers per page: