Keyword: programming: branch and bound

Found 862 papers in total
Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method
Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method
2002,
An interesting combinatorial (enumeration) problem arises in the initial phase of the...
An exact algorithm for the maximum k-club problem in an undirected graph
An exact algorithm for the maximum k-club problem in an undirected graph
2002,
In this paper, we prove that the maximum k -club problem (M k CP) defined on an...
Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
2001,
The satisfiability problem in forms such as maximum satisfiability (MAX-SAT) remains a...
An extension to the branch-and-bound algorithm for the multi-mode multiple resource-constrained project scheduling problems
An extension to the branch-and-bound algorithm for the multi-mode multiple resource-constrained project scheduling problems
2001,
This paper deals with the multi-mode multiple resource-constrained project scheduling...
Parallel machine scheduling with a common due window
Parallel machine scheduling with a common due window
2002,
In this paper, we consider a machine scheduling problem where jobs should be completed...
A branch-and-bound algorithm for the multiple resource-constrained project scheduling problem with each activity duration dependent upon its actual start-time
A branch-and-bound algorithm for the multiple resource-constrained project scheduling problem with each activity duration dependent upon its actual start-time
2001,
This paper deals with the multiple resource-constrained project scheduling problem. It...
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
2000,
In this paper, we deal with a network design problem arising from the deployment of...
A pegging algorithm for the nonlinear resource allocation problem
A pegging algorithm for the nonlinear resource allocation problem
2002,
In this paper we present a new algorithm for solving the nonlinear resource allocation...
The feeder fleet planning problem of the same-day ground express service in Taiwan
The feeder fleet planning problem of the same-day ground express service in Taiwan
2001,
Time-definite freight delivery common carriers in Taiwan provide same-day ground...
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
1998,
Given is an undirected graph with positive or negative edge weights which represent a...
Solving Steiner tree problems in graphs to optimality
Solving Steiner tree problems in graphs to optimality
1998,
In this paper, we present the implementation of a branch-and-cut algorithm for solving...
A branch-and-cut algorithm for the undirected selective traveling salesman problem
A branch-and-cut algorithm for the undirected selective traveling salesman problem
1998,
The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits...
Hybrid flow-shop scheduling with assembly operations
Hybrid flow-shop scheduling with assembly operations
2001,
Hybrid scheduling for the production system including parts machining and assembly...
Project scheduling with multiple modes: A comparison of exact algorithms
Project scheduling with multiple modes: A comparison of exact algorithms
1998,
This paper is devoted to a comparison of all available branch-and-bound algorithms...
Linear one-dimensional cutting–packing problems: Numerical experiments with sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Linear one-dimensional cutting–packing problems: Numerical experiments with sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
2000,
Two algorithms for the one-dimensional cutting problem, namely, a modified...
Rotation cycle schedulings for multi-item production systems
Rotation cycle schedulings for multi-item production systems
2001,
Consider the production planning and scheduling on a single machine with finite...
The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
2001,
We introduce a formulation and an exact solution method for a nonpreemptive resource...
A flexible flowshop problem with total flow time minimization
A flexible flowshop problem with total flow time minimization
2001,
In this study, we consider total flow time problem in a flexible flowshop environment....
A branch and bound algorithm for the minimum storage-time sequencing problem
A branch and bound algorithm for the minimum storage-time sequencing problem
2001,
The minimum storage-time sequencing problem generalizes many well-known problems in...
Iterative coloring extension of a maximum clique
Iterative coloring extension of a maximum clique
2001,
In this paper we present an improved branch and bound algorithm for the vertex...
An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
2001,
In this paper, we consider an optimization problem which aims to minimize a convex...
Solving the two-connected network with bounded meshes problem
Solving the two-connected network with bounded meshes problem
2000,
We study the problem of designing at minimum cost a two-connected network such that...
Algorithmical approaches to business process design
Algorithmical approaches to business process design
2001,
The paper introduces formal models of the business process design problem, which can...
A family of facets for the uncapacitated p-median polytope
A family of facets for the uncapacitated p-median polytope
2001,
We present a nontrivial family of facet-defining inequalities for the uncapacitated p...
Papers per page: