Keyword: programming: branch and bound

Found 862 papers in total
Branch-and-Price algorithm for a capacitated lot-sizing problem
Branch-and-Price algorithm for a capacitated lot-sizing problem
2003,
A new Branch-and-Price approach was presented to solve the classical capacitated...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2004,
The simple plant location problem is a well-suited problem in combinatorial...
Scheduling under machine breakdown in a continuous process industry
Scheduling under machine breakdown in a continuous process industry
2004,
In many continuous process industries, machine breakdowns may affect the planned...
An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
2003,
We consider a scheduling problem in which n jobs with distinct deadlines are to be...
Logic cuts for multilevel generalized assignment problems
Logic cuts for multilevel generalized assignment problems
2003,
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at...
Minimizing the weighted number of tardy jobs on a single machine
Minimizing the weighted number of tardy jobs on a single machine
2003,
In this paper, we describe an exact algorithm to solve the single machine weighted...
Unsing short-term memory to minimize the weighted number of late jobs on a single machine
Unsing short-term memory to minimize the weighted number of late jobs on a single machine
2003,
In this paper, we investigate the problem of minimizing the weighted number of late...
Dynamic capacity acquisition and assignment under uncertainty
Dynamic capacity acquisition and assignment under uncertainty
2003,
Given a set of m resources and n tasks, the dynamic capacity acquisition and...
Difference of convex solution of quadratically constrained optimization problems
Difference of convex solution of quadratically constrained optimization problems
2003,
Recently, global optimization algorithms have been proposed for solving nonconvex...
A technical review of column generation in integer programming
A technical review of column generation in integer programming
2001,
This paper provides a technical review of topics relevant to applying column...
An interactive procedure dedicated to a bicriteria plant location model
An interactive procedure dedicated to a bicriteria plant location model
2003,
In this paper a new algorithm is described which aims at solving efficiently a simple...
Progress payments in project scheduling problems
Progress payments in project scheduling problems
2003,
In this paper we study the unconstrained project scheduling problem with discounted...
Scheduling unrelated parallel machines to minimize total weighted tardiness
Scheduling unrelated parallel machines to minimize total weighted tardiness
2003,
This article considers the problem of scheduling a given set of independent jobs on...
Minimizing the weighted number of tardy jobs on a two-machine flow shop
Minimizing the weighted number of tardy jobs on a two-machine flow shop
2003,
In this paper, we describe an exact algorithm to solve the weighted number of tardy...
An exact algorithm for the two-constraint 0–1 knapsack problem
An exact algorithm for the two-constraint 0–1 knapsack problem
2003,
We consider a knapsack problem in which each item has two types of weight and the...
U-OPT: an analysis of exact U-shaped line balancing procedures
U-OPT: an analysis of exact U-shaped line balancing procedures
2003,
The U-shaped assembly line-balancing problem can be solved using optimization...
A branch and bound algorithm to minimize completion time variance on a single processor
A branch and bound algorithm to minimize completion time variance on a single processor
2003,
In this paper we discuss a single machine scheduling problem with the objective of...
Single-machine scheduling with periodic maintenance and nonresumable jobs
Single-machine scheduling with periodic maintenance and nonresumable jobs
2003,
We study a single-machine scheduling problem where periodic maintenance is required in...
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
2003,
This paper presents a branch and bound algorithm for the single machine scheduling...
A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
2003,
The paper presents an exact procedure for a general resource-constrained project...
Exact algorithms for scheduling multiple families of jobs on parallel machines
Exact algorithms for scheduling multiple families of jobs on parallel machines
2003,
In many practical manufacturing environments, jobs to be processed can be divided into...
Solving the area-restricted harvest-scheduling model using the branch and bound algorithm
Solving the area-restricted harvest-scheduling model using the branch and bound algorithm
2003,
There are two broad approaches to the discrete optimization problem of harvest...
A branch-and-bound-based local search method for the flow shop problem
A branch-and-bound-based local search method for the flow shop problem
2003,
It is well-known that exact branch and bound methods can only solve small or...
Approximate algorithm for solving resource levelling problems in project scheduling
Approximate algorithm for solving resource levelling problems in project scheduling
2002,
Through analyzing similarities and differences between the resource levelling problem...
Papers per page: