Keyword: programming: branch and bound

Found 862 papers in total
New exact method to solve the Pm|rj|∑Cj
New exact method to solve the Pm|rj|∑Cj
2006,
This paper addresses a parallel machine scheduling problem (PMSP) with release dates...
An improved branch and bound procedure for scheduling a flow line manufacturing cell
An improved branch and bound procedure for scheduling a flow line manufacturing cell
2005,
This paper presents a new branch and bound procedure for scheduling a flow-line...
B&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
B&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
2005,
The purpose of this paper is to investigate branch and bound strategies and the...
Solving a multiobjective possibilistic problem through compromise programming
Solving a multiobjective possibilistic problem through compromise programming
2005,
Real decision problems usually consider several objectives that have parameters which...
Solving the combinatorial double auction problem
Solving the combinatorial double auction problem
2005,
This paper studies the solution of several types of combinatorial (double) auctions....
A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound
A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound
2005,
This paper considers the exact approach of branch and bound (B&B) and the...
Scheduling resource-constrained projects using branch and bound and parallel computing techniques
Scheduling resource-constrained projects using branch and bound and parallel computing techniques
2005,
Based on the idea of dividing the task into several processes, we centre our interest...
Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints
Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints
2002,
This paper is concerned with resource-constrained project scheduling problems where...
Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications
Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications
2005,
This paper reviews the advances of mixed-integer linear programming (MILP) based...
Scheduling two-machine no-wait open shops to minimize makespan
Scheduling two-machine no-wait open shops to minimize makespan
2005,
This paper examines the problem of scheduling two-machine no-wait open shops to...
A computational study of the permutation flow shop problem based on a tight lower bound
A computational study of the permutation flow shop problem based on a tight lower bound
2005,
We consider the classical permutation flow shop problem which requires scheduling n...
A combined approach to the solution to the general one-dimensional cutting stock problem
A combined approach to the solution to the general one-dimensional cutting stock problem
2005,
In this article a combined method for the solution to the general one-dimensional...
Where are the hard knapsack problems?
Where are the hard knapsack problems?
2005,
The knapsack problem is believed to be one of the “easier” NP -hard...
Scheduling preemptive open shops to minimize total tardiness
Scheduling preemptive open shops to minimize total tardiness
2005,
This article considers the problem of scheduling preemptive open shops to minimize...
An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system
An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system
2005,
This research addresses the problem of scheduling batches of parts in a flexible...
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
2005,
This work addresses the minimization of the makespan criterion for the flowshop...
A branch and bound approach and heuristic algorithms for scheduling a batching machine
A branch and bound approach and heuristic algorithms for scheduling a batching machine
2004,
A batch machine or batching processing machine is one that can process several jobs...
A Lagrangian decomposition and domain cut algorithm for nonseparable convex knapsack problems
A Lagrangian decomposition and domain cut algorithm for nonseparable convex knapsack problems
2004,
In this paper, we present an exact algorithm for solving nonseparable convex knapsack...
Decomposition methods for solving nonconvex quadratic programs via branch and bound
Decomposition methods for solving nonconvex quadratic programs via branch and bound
2005,
The aim of this paper is to suggest branch and bound schemes, based on a relaxation of...
A branch-and-cut algorithm for the maximum cardinality stable set problem
A branch-and-cut algorithm for the maximum cardinality stable set problem
2001,
We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem....
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
2005,
In the m -Peripatetic Salesman Problem ( m -PSP) the aim is to determine m edge...
A note on “An exact method for cost-oriented assembly line balancing”
A note on “An exact method for cost-oriented assembly line balancing”
2005,
Amen considers a cost-oriented assembly line balancing problem with wages and capital...
Minimizing the weighted number of tardy jobs on parallel processors
Minimizing the weighted number of tardy jobs on parallel processors
2005,
We present a branch-and-bound algorithm to minimize the weighted number of tardy jobs...
A note on exact algorithms for the identical parallel machine scheduling problem
A note on exact algorithms for the identical parallel machine scheduling problem
2005,
A recently published paper by Mokotoff presents an exact algorithm for the classical...
Papers per page: