Keyword: programming: branch and bound

Found 862 papers in total
An exact algorithm for the vehicle routing problem with backhauls
An exact algorithm for the vehicle routing problem with backhauls
1997,
The Vehicle Routing Problem with Backhauls is an extension of the capacitated Vehicle...
Finding postal carrier walk paths in mixed graphs
Finding postal carrier walk paths in mixed graphs
1998,
The postman problem requires finding a lowest cost tour in a connected graph that...
A linear programming formulation with integer solutions for solving an equipment replacement problem with multiple assets: The concave demand case
A linear programming formulation with integer solutions for solving an equipment replacement problem with multiple assets: The concave demand case
1998,
A linear programming formulation is presented for the deterministic equipment...
The capacitated multiple allocation hub location problem: Formulations and algorithms
The capacitated multiple allocation hub location problem: Formulations and algorithms
2000,
In this paper we consider and present formulations and solution approaches for the...
A parallel interior point method and its application to facility location problems
A parallel interior point method and its application to facility location problems
1998,
We present a parallel interior point algorithm to solve block structured linear...
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
2000,
We present a branch and cut algorithm that yields in finite time, a globally...
An exact constraint logic programming algorithm for the travelling salesman problem with time windows
An exact constraint logic programming algorithm for the travelling salesman problem with time windows
1998,
This paper presents a constraint logic programming model for the traveling salesman...
A model of multiple nested inspections at different intervals
A model of multiple nested inspections at different intervals
2000,
Although much has been published concerning the optimality of a single‐type...
An exact method for the two‐echelon, single‐source, capacitated facility location problem
An exact method for the two‐echelon, single‐source, capacitated facility location problem
2000,
Facility location problems form an important class of integer programming problems,...
An outer approximate subdifferential method for piecewise affine optimization
An outer approximate subdifferential method for piecewise affine optimization
2000,
Piecewise affine functions arise from Lagrangian duals of integer programming...
Computational analysis of a flexible assembly system design problem
Computational analysis of a flexible assembly system design problem
2000,
Global competitive priorities are undergoing a marked shift from productivity and...
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
2000,
This paper addresses the two-machine flowshop problem to minimize mean flowtime where...
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
2000,
In this paper we deal with the problem of assigning a set of n jobs, with release...
Minimizing tardy jobs in a flowshop with common due date
Minimizing tardy jobs in a flowshop with common due date
2000,
This paper considers the two-machine flowshop scheduling problem where the total time...
A branch-and-bound algorithm for the hybrid flowshop
A branch-and-bound algorithm for the hybrid flowshop
2000,
This paper introduces a branch-and-bound algorithm for the hybrid flowshop scheduling...
Procedures for providing robust gate assignments for arriving aircrafts
Procedures for providing robust gate assignments for arriving aircrafts
2000,
Assigning commercial service aircrafts to the available gates at an airport depends on...
Telecommunication node clustering with node compatibility and network survivability requirements
Telecommunication node clustering with node compatibility and network survivability requirements
2000,
We consider the node clustering problem that arises in designing a survivable...
The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
2000,
This paper presents the results of an empirical study of the effects of coefficient...
Mean-absolute deviation portfolio optimization model under transaction costs
Mean-absolute deviation portfolio optimization model under transaction costs
1999,
We will propose a branch and bound algorithm for solving a portfolio optimization...
A subdivisional scheme for linear programs with an additional reverse convex constraint
A subdivisional scheme for linear programs with an additional reverse convex constraint
1998,
In this paper, global optimization of linear programs with an additional reverse...
On the selection of relay points in a logistics system
On the selection of relay points in a logistics system
1997,
In this paper, we consider a location problem of relay points in a logistics system....
The uncapacitated multi-period facilities location problem with profit maximization
The uncapacitated multi-period facilities location problem with profit maximization
1999,
The literature on the facilities location problem is quite extensive with a wide...
Job shop scheduling with beam search
Job shop scheduling with beam search
1999,
Beam search is a heuristic method for solving optimization problems. It is an...
A branch-and-bound procedure for the generalized resource-constrained project scheduling problem
A branch-and-bound procedure for the generalized resource-constrained project scheduling problem
1997,
In this paper a branch-and-bound procedure is described for scheduling project...
Papers per page: