Keyword: programming: branch and bound

Found 862 papers in total
Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
2006,
This paper deals with a single-machine scheduling problem with limited machine...
A three-machine permutation flow-shop problem with minimum makespan on the second machine
A three-machine permutation flow-shop problem with minimum makespan on the second machine
2006,
In this paper, we consider a three-machine permutation flow-shop scheduling problem...
A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families
A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families
2006,
This research deals with developing a branch and bound algorithm for minimising total...
A combinatorial characterization of higher-dimensional orthogonal packing
A combinatorial characterization of higher-dimensional orthogonal packing
2004,
Higher-dimensional orthogonal packing problems have a wide range of practical...
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
2006,
We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of...
Solving the asymmetric traveling purchaser problem
Solving the asymmetric traveling purchaser problem
2006,
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the...
A branch-and-bound algorithm to globally solve the sum of several linear ratios
A branch-and-bound algorithm to globally solve the sum of several linear ratios
2005,
In this paper we propose a branch-and-bound algorithm to globally solve the sum of...
A new two-level linear relaxed bound method for geometric programming problems
A new two-level linear relaxed bound method for geometric programming problems
2005,
In this paper a new two-level linear relaxed bound method is proposed for solving the...
Exact MAX-2SAT solution via lift-and-project closure
Exact MAX-2SAT solution via lift-and-project closure
2006,
We present a new approach for exact solution of MAX-2SAT problems based on a strong...
A simple lower bound for total completion time minimization in a two-machine flowshop
A simple lower bound for total completion time minimization in a two-machine flowshop
2005,
The purpose of this study is to present a simple lower bound to facilitate the...
Two-machine flow-shop scheduling to minimize total late work
Two-machine flow-shop scheduling to minimize total late work
2006,
This article considers a two-machine flow-shop scheduling problem of minimizing total...
Integrating constraint propagation technique into branch-and-bound algorithm for job shop scheduling
Integrating constraint propagation technique into branch-and-bound algorithm for job shop scheduling
2005,
CSP (constraint satisfactory problem) has the advantage of solving complicated...
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
2006,
The one-dimensional cutting stock problem (1D-CSP) and the two-dimensional two-stage...
Optimal solutions for the closest-string problem via integer programming
Optimal solutions for the closest-string problem via integer programming
2004,
In this paper we study the closest-string problem (CSP), which can be defined as...
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
2006,
There appear to be two versions of the Dual Bin Packing problem in the literature. In...
Airport management: taxi planning
Airport management: taxi planning
2006,
The Taxi Planning studies the aircraft routing and scheduling on the airport ground....
Laying out sparse graphs with provably minimum bandwidth
Laying out sparse graphs with provably minimum bandwidth
2005,
Finding a linear layout of a graph having minimum bandwidth is a combinatorial...
A column generation approach for SONET ring assignment
A column generation approach for SONET ring assignment
2006,
In this article we consider the SONET ring assignment problem (SRAP). The authors...
Exact methods based on node-routing formulations for undirected arc-routing problems
Exact methods based on node-routing formulations for undirected arc-routing problems
2006,
This article proposes a new transformation of undirected arc-routing problems into...
Solving convex mixed integer nonlinear programming optimization problems using a sequential cutting plane algorithm
Solving convex mixed integer nonlinear programming optimization problems using a sequential cutting plane algorithm
2006,
In this article we look at a new algorithm for solving convex mixed integer nonlinear...
Approximate and exact algorithms for the fixed-charge knapsack problem
Approximate and exact algorithms for the fixed-charge knapsack problem
2006,
The subject of this paper is the formulation and solution of a variation of the...
On bridging the gap between stochastic integer programming and MIP solver technologies
On bridging the gap between stochastic integer programming and MIP solver technologies
2004,
Stochastic integer programs (SIPs) represent a very difficult class of optimization...
Integration and propagation of a multi-criteria decision making model in constraint programming
Integration and propagation of a multi-criteria decision making model in constraint programming
2006,
In this paper we propose a general integration scheme for a Multi-Criteria Decision...
Global optimization using a dynamical systems approach
Global optimization using a dynamical systems approach
2006,
We develop new algorithms for global optimization by combining well known branch and...
Papers per page: