Keyword: programming: branch and bound

Found 862 papers in total
Tactical design of rail freight networks. Part I: Exact and heuristic methods
Tactical design of rail freight networks. Part I: Exact and heuristic methods
1996,
The tactical planning of rail freight networks is studied with the help of non-convex...
Single machine scheduling to minimize total weighted late work
Single machine scheduling to minimize total weighted late work
1995,
In the problem of scheduling a single machine to minimize total weighted late work,...
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
1996,
We address the NP-hard single-machine problem of scheduling n independent jobs so as...
Scheduling alternative operations in two-machine flow-shops
Scheduling alternative operations in two-machine flow-shops
1997,
Most of the previous studies on scheduling problems assume that each machine is used...
Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
1997,
Branch and bound methods for scheduling problems with multiprocessor tasks on...
A matching based exact algorithm for capacitated vehicle routing problems
A matching based exact algorithm for capacitated vehicle routing problems
1995,
A branch and bound algorithm for capacitated vehicle routing is described. Lower...
Daily aircraft routing and scheduling
Daily aircraft routing and scheduling
1997,
In this paper we consider the daily aircraft routing and scheduling problem (DARSP)....
How much communication does parallel branch and bound need?
How much communication does parallel branch and bound need?
1997,
Consider the classical branch and bound algorithm for mixed integer programming (MIP)....
Optimal procedures for the discrete time/cost trade-off problem in project networks
Optimal procedures for the discrete time/cost trade-off problem in project networks
1996,
We describe two algorithms, based on dynamic programming logic, for optimally solving...
Heuristics for bounded two-stage guillotine cutting
Heuristics for bounded two-stage guillotine cutting
1996,
In the literature there exist only a few solution techniques for bounded...
An expanding-core algorithm for the exact 0–1 Knapsack Problem
An expanding-core algorithm for the exact 0–1 Knapsack Problem
1995,
A new branch-and-bound algorithm for the exact solution of the 0–1 Knapsack...
The nonlinear resource allocation problem
The nonlinear resource allocation problem
1995,
In this paper we study the nonlinear resource allocation problem, defined as the...
A branch-and-bound algorithm for computing optimal replacement policies in K-out-of-N systems
A branch-and-bound algorithm for computing optimal replacement policies in K-out-of-N systems
1995,
We study a discrete time, infinite-horizon, dynamic programming model for the...
An integrated formulation of manufacturing cell formation with capacity planning and multiple routings
An integrated formulation of manufacturing cell formation with capacity planning and multiple routings
1998,
This paper presents an integrated mathematical programming formulation of the...
A new algorithm for solving the general quadratic programming problem
A new algorithm for solving the general quadratic programming problem
1996,
For the general quadratic programming problem (including an equivalent form of the...
A note on the complexity of the Asymmetric Traveling Salesman Problem
A note on the complexity of the Asymmetric Traveling Salesman Problem
1997,
One of the most efficient approaches known for finding an optimal tour of the...
A minimax assignment problem in treelike communication networks
A minimax assignment problem in treelike communication networks
1995,
A given system of communication centres C 1 , C 2...
The capacitated plant location problem
The capacitated plant location problem
1995,
This paper provides a review of the various solution methods for the capacitated plant...
Exact solution procedures for certain planning problems in flexible manufacturing systems
Exact solution procedures for certain planning problems in flexible manufacturing systems
1997,
We address certain production planning problems in a flexible manufacturing...
Minimizing total tardiness in permutation flowshops
Minimizing total tardiness in permutation flowshops
1995,
We consider the permutation flowshop scheduling problem with the objective of...
Resolution of the Cyclic Multi-Hoists Scheduling Problem with overlapping partitions
Resolution of the Cyclic Multi-Hoists Scheduling Problem with overlapping partitions
1997,
This paper deals with scheduling problem in electroplating facilities. To maximise the...
Optimal location of routes for vehicles transporting hazardous materials
Optimal location of routes for vehicles transporting hazardous materials
1995,
This paper deals with the selection of optimal routes for the transportation of...
An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
1995,
This work is concerned with unconstrained two-dimensional non-guillotine cutting...
Generalized pairwise interchanges and machine scheduling
Generalized pairwise interchanges and machine scheduling
1995,
In this paper a generalization of pairwise interchanges is considered and applied to...
Papers per page: