Keyword: programming: branch and bound

Found 862 papers in total
Natural gas bilevel cash‐out problem: Convergence of a penalty function method
Natural gas bilevel cash‐out problem: Convergence of a penalty function method
2011,
This paper studies a special bi‐level programming problem that arises from the...
Single‐machine scheduling of proportionally deteriorating jobs by two agents
Single‐machine scheduling of proportionally deteriorating jobs by two agents
2011,
We consider a problem of scheduling a set of independent jobs by two agents on a...
Optimal operating strategy for a long‐haul liner service route
Optimal operating strategy for a long‐haul liner service route
2011,
This paper proposes an optimal operating strategy problem arising in liner shipping...
Combining DC‐programming and steepest‐descent to solve the single‐vehicle inventory routing problem
Combining DC‐programming and steepest‐descent to solve the single‐vehicle inventory routing problem
2011,
The single‐vehicle cyclic inventory routing problem (SV‐CIRP) is...
The Dynamic Uncapacitated Hub Location Problem
The Dynamic Uncapacitated Hub Location Problem
2011,
This paper presents a dynamic (or multi‐period) hub location problem . It...
A tabu search heuristic for solving the multi‐depot, multi‐vehicle, double request dial‐a‐ride problem faced by a healthcare organisation
A tabu search heuristic for solving the multi‐depot, multi‐vehicle, double request dial‐a‐ride problem faced by a healthcare organisation
2011,
In the Center for Addictive Behavior Health and Recovery Services, Inc....
Optimising the design of a supply chain network with economies of scale using mixed integer programming
Optimising the design of a supply chain network with economies of scale using mixed integer programming
2011,
In this paper, we formulate and analyse the design of a supply chain network where the...
Minimizing the sum of maximum earliness and maximum tardiness in the single‐machine scheduling problem with sequence‐dependent setup time
Minimizing the sum of maximum earliness and maximum tardiness in the single‐machine scheduling problem with sequence‐dependent setup time
2011,
This paper considers the problem of scheduling a given number of jobs on a single...
Single‐machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
Single‐machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
2011,
In many realistic production situations, a job processed later consumes more time than...
An investigation into two bin packing problems with ordering and orientation implications
An investigation into two bin packing problems with ordering and orientation implications
2011,
This paper considers variants of the one‐dimensional bin packing (and stock...
Exact resolution of the one‐machine sequencing problem with no machine idle time
Exact resolution of the one‐machine sequencing problem with no machine idle time
2010,
This paper investigates the one‐machine sequencing problem in a workshop where...
Exact and heuristic algorithms for parallel‐machine scheduling with DeJong’s learning effect
Exact and heuristic algorithms for parallel‐machine scheduling with DeJong’s learning effect
2010,
We consider a parallel‐machine scheduling problem with a learning effect and...
A time‐indexed LP‐based approach for min‐sum job‐shop problems
A time‐indexed LP‐based approach for min‐sum job‐shop problems
2011,
In this paper we propose two time‐indexed IP formulations for job‐shop...
Relaxations and exact solution of the variable sized bin packing problem
Relaxations and exact solution of the variable sized bin packing problem
2011,
We address a generalization of the classical one‐dimensional bin packing...
Relaxing the optimality conditions of box QP
Relaxing the optimality conditions of box QP
2011,
We present semidefinite relaxations of nonconvex, box‐constrained quadratic...
Airport runway scheduling
Airport runway scheduling
2011,
Airport runway optimization is an ongoing challenge for air traffic controllers. Since...
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
2009,
The flowshop scheduling problem with blocking in‐process is addressed in this...
A conic quadratic formulation for a class of convex congestion functions in network flow problems
A conic quadratic formulation for a class of convex congestion functions in network flow problems
2011,
In this paper we consider a multicommodity network flow problem with flow routing and...
Complex university course timetabling
Complex university course timetabling
2011,
This paper summarizes the work done to solve a complex course timetabling problem at a...
Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
2010,
Cadaveric liver transplantation is the only viable therapy for end‐stage liver...
Implementing a branch-and-bound algorithm for transductive support vector machines
Implementing a branch-and-bound algorithm for transductive support vector machines
2010,
Semi-supervised learning incorporates unlabeled examples, whose labels are unknown, as...
Point-to-point shortest paths on dynamic time-dependent road networks
Point-to-point shortest paths on dynamic time-dependent road networks
2010,
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste...
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
2010,
We study parallel complexity of the branch-and-bound method for optimization problems....
A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
2010,
In this paper, we consider the problem of scheduling n jobs on a single machine to...
Papers per page: