Keyword: programming: branch and bound

Found 862 papers in total
Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs
Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs
2012,
Just‐in‐time JIT (Just In Time) is an important procedure in...
Branch and bound for the cutwidth minimization problem
Branch and bound for the cutwidth minimization problem
2013,
The cutwidth minimization problem consists of finding a linear arrangement of the...
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
2013,
This paper deals with the single machine total tardiness problem, and proves that if...
An exact method for scheduling of the alternative technologies in R&D projects
An exact method for scheduling of the alternative technologies in R&D projects
2013,
A fundamental challenge associated with research or new product development projects...
Two‐agent singe‐machine scheduling with release times to minimize the total weighted completion time
Two‐agent singe‐machine scheduling with release times to minimize the total weighted completion time
2013,
In many management situations multiple agents pursuing different objectives compete on...
A heuristic method for two‐stage hybrid flow shop with dedicated machines
A heuristic method for two‐stage hybrid flow shop with dedicated machines
2013,
This paper considers a two‐stage hybrid flow shop scheduling problem with...
Multiple objective branch and bound for mixed 0‐1 linear programming: Corrections and improvements for the biobjective case
Multiple objective branch and bound for mixed 0‐1 linear programming: Corrections and improvements for the biobjective case
2013,
This work addresses the correction and improvement of Mavrotas and Diakoulaki's branch...
Polyhedral study of the maximum common induced subgraph problem
Polyhedral study of the maximum common induced subgraph problem
2012,
In this paper we present an exact algorithm for the Maximum Common Induced Subgraph...
On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope
On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope
2011,
In this paper, a finite branch‐and‐bound algorithm is developed for the...
Latent variables and route choice behavior
Latent variables and route choice behavior
2012,
In the last decade, a broad array of disciplines has shown a general interest in...
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
2012,
We explore in this paper certain rich geometric properties hidden behind quadratic...
Higher‐level RLT or disjunctive cuts based on a partial enumeration strategy for 0‐1 mixed‐integer programs
Higher‐level RLT or disjunctive cuts based on a partial enumeration strategy for 0‐1 mixed‐integer programs
2012,
In this paper, we consider the generation of disjunctive cuts for 0‐1...
DCA for solving the scheduling of lifting vehicle in an automated port container terminal
DCA for solving the scheduling of lifting vehicle in an automated port container terminal
2012,
The container was introduced as a universal carrier for various goods in the 1960s and...
Branch‐and‐bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Branch‐and‐bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
2012,
In this paper, we consider a single‐machine scheduling problem with release...
A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
2012,
In this paper, we consider a single batch machine scheduling problem with incompatible...
Fast bounding procedures for large instances of the Simple Plant Location Problem
Fast bounding procedures for large instances of the Simple Plant Location Problem
2012,
Some new, simple and extremely fast bounding procedures are presented for...
Minimizing the weighted sum of squared tardiness on a single machine
Minimizing the weighted sum of squared tardiness on a single machine
2012,
This paper considers a problem in which there is a set of jobs to be sequenced on a...
Study on berth planning problem in a container seaport: Using an integrated programming approach
Study on berth planning problem in a container seaport: Using an integrated programming approach
2012,
This paper provides an integrated solution for two common processes in a container...
A convergent simplicial algorithm with ω‐subdivision and ω‐bisection strategies
A convergent simplicial algorithm with ω‐subdivision and ω‐bisection strategies
2012,
The simplicial algorithm is a kind of branch‐and‐bound method for...
An improved algorithm to test copositivity
An improved algorithm to test copositivity
2012,
Copositivity plays a role in combinatorial and nonconvex quadratic optimization....
An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
2012,
In this paper we propose an exact algorithm for the Resource Constrained Project...
On air traffic flow management with rerouting. Part I: Deterministic case
On air traffic flow management with rerouting. Part I: Deterministic case
2012,
In this paper a deterministic mixed 0–1 model for the air traffic flow...
Product line pricing for services with capacity constraints and dynamic substitution
Product line pricing for services with capacity constraints and dynamic substitution
2012,
In this paper, we address a service provider’s product line pricing problem for...
A two‐phase method for selecting IMRT treatment beam angles: Branch‐and‐Prune and local neighborhood search
A two‐phase method for selecting IMRT treatment beam angles: Branch‐and‐Prune and local neighborhood search
2012,
This paper presents a new two‐phase solution approach to the beam angle and...
Papers per page: