Keyword: programming: branch and bound

Found 862 papers in total
Branch and bound crossed with GA to solve hybrid flowshops
Branch and bound crossed with GA to solve hybrid flowshops
1998,
This article deals with an optimal method for solving a k -stage hybrid flowshop...
A new decomposition approach for the single machine total tardiness scheduling problem
A new decomposition approach for the single machine total tardiness scheduling problem
1998,
This paper deals with the single machine total tardiness problem. From Emmons' basic...
New algorithms for product positioning
New algorithms for product positioning
1998,
Two new algorithms are proposed for the problem of positioning a new product in...
Discrete lotsizing and scheduling by batch sequencing
Discrete lotsizing and scheduling by batch sequencing
1998,
The discrete lotsizing and scheduling problem for one machine with sequence-dependent...
An exact algorithm for the resource-constrained Project Scheduling Problem based on a new mathematical formulation
An exact algorithm for the resource-constrained Project Scheduling Problem based on a new mathematical formulation
1998,
In this paper we consider the Project Scheduling Problem with resource constraints,...
Scheduling deteriorating jobs to minimize makespan
Scheduling deteriorating jobs to minimize makespan
1998,
We consider a single-machine problem of scheduling n independent jobs to minimize...
The teacher assignment problem: A special case of the fixed charge transportation problem
The teacher assignment problem: A special case of the fixed charge transportation problem
1997,
A basic model of the task of assigning classes to professors, in such a way that the...
Branch-and-price algorithms for the one-dimensional cutting stock problem
Branch-and-price algorithms for the one-dimensional cutting stock problem
1998,
We compare two branch-and-price approaches for the cutting stock problem. Each...
Exact algorithms for the guillotine strip cutting/packing problem
Exact algorithms for the guillotine strip cutting/packing problem
1998,
In this paper we present exact algorithms for strip cutting/packing problems. The...
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
1998,
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard...
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...
Global optimization techniques for solving the general quadratic integer programming problem
Global optimization techniques for solving the general quadratic integer programming problem
1998,
We consider the problem of minimizing a general quadratic function over a polytope in...
An enumerative algorithm framework for a class of nonlinear integer programming problems
An enumerative algorithm framework for a class of nonlinear integer programming problems
1997,
This paper represents a framework for a branch and search algorithm for solving a...
Branch-and-price: Column generation for solving huge integer programs
Branch-and-price: Column generation for solving huge integer programs
1998,
We discuss formulations of integer programs with a huge number of variables and their...
Solving the orienteering problem through branch-and-cut
Solving the orienteering problem through branch-and-cut
1998,
In the Orienteering Problem (OP), we are given an undirected graph with edge weights...
An incremental branch-and-bound method for the satisfiability problem
An incremental branch-and-bound method for the satisfiability problem
1998,
The satisfiability problem is to check whether a set of clauses in propositional logic...
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
1998,
The network design problem is a multicommodity minimal cost network flow problem with...
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...
On a pattern sequencing problem to minimize the maximum number of open stacks
On a pattern sequencing problem to minimize the maximum number of open stacks
1997,
Consider a wood cutting setting where different panels have to be cut from large...
Resource-constrained project scheduling: A survey of recent developments
Resource-constrained project scheduling: A survey of recent developments
1998,
We review recent advances in dealing with the resource-constrained project scheduling...
Local search methods for the discrete time/resource trade-off problem in project networks
Local search methods for the discrete time/resource trade-off problem in project networks
1998,
In this paper we consider the discrete time/resource trade-off problem in project...
Optimal software implementation considering reliability and cost
Optimal software implementation considering reliability and cost
1998,
It is becoming increasingly difficult to create software products that simultaneously...
A new lower bounding scheme for the total weighted tardiness problem
A new lower bounding scheme for the total weighted tardiness problem
1998,
We propose a new dominance rule that provides a sufficient condition for local...
The mixed and multi model line balancing problem: A comparison
The mixed and multi model line balancing problem: A comparison
1997,
The balancing problem deals with the assignment of tasks to work stations. We can...
Papers per page: