Keyword: programming: branch and bound

Found 862 papers in total
A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times
A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times
2009,
This article addresses the problem of minimizing the sum of maximum earliness and...
Optimal resource allocation for hybrid flow shop in one-of-a-kind production
Optimal resource allocation for hybrid flow shop in one-of-a-kind production
2010,
In one-of-a-kind production (OKP) companies, the number of production resources in...
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Reformulations and solution algorithms for the maximum leaf spanning tree problem
2010,
Given a graph G = ( V , E ), the maximum leaf spanning tree problem (MLSTP) is to find...
Single machine scheduling with preventive maintenances
Single machine scheduling with preventive maintenances
2009,
We consider the single machine total flow time problem in which the jobs are...
A fixed job scheduling problem with machine-dependent job weights
A fixed job scheduling problem with machine-dependent job weights
2009,
This study considers the identical parallel machines operational fixed job scheduling...
Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches
Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches
2009,
This study considers an operation assignment and capacity allocation problem that...
An exact algorithm for factor model in portfolio selection with roundlot constraints
An exact algorithm for factor model in portfolio selection with roundlot constraints
2009,
We consider in this article a factor model in portfolio selection with roundlot...
Optimally solving the alternative subgraphs assembly line balancing problem
Optimally solving the alternative subgraphs assembly line balancing problem
2009,
Assembly line balancing problems (ALBP) consist of distributing the total workload for...
Economic design of water distribution systems in buildings
Economic design of water distribution systems in buildings
2008,
This article discusses an engineering optimization problem which arises in hydraulics...
A Lagrangian approach to single-machine scheduling problems with two competing agents
A Lagrangian approach to single-machine scheduling problems with two competing agents
2009,
In this paper, we develop branch-and-bound algorithms for several hard, two-agent...
Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
2009,
In many real situations, it is found that if certain maintenance procedures fail to be...
Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
2009,
The problem of scheduling in permutation flowshops is considered in this paper with...
A literature review on circle and sphere packing problems: Models and methodologies
A literature review on circle and sphere packing problems: Models and methodologies
2009,
This paper reviews the most relevant literature on efficient models and methods for...
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
2009,
In this paper, we consider a two-machine flowshop scheduling problem in which the...
New dynamic programming algorithms for the resource constrained elementary shortest path problem
New dynamic programming algorithms for the resource constrained elementary shortest path problem
2008,
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing...
A Reach and Bound algorithm for acyclic dynamic-programming networks
A Reach and Bound algorithm for acyclic dynamic-programming networks
2008,
Node pruning is a commonly used technique for solution acceleration in a...
A branch and bound algorithm for the strip packing problem
A branch and bound algorithm for the strip packing problem
2009,
We propose a new branch and bound algorithm for the two dimensional strip packing...
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
2008,
This paper develops a linear–programming–based...
A relax-and-cut algorithm for the knapsack node weighted Steiner tree problem
A relax-and-cut algorithm for the knapsack node weighted Steiner tree problem
2008,
The Knapsack Node Weighted Steiner Tree Problem (KNWSTP) is a generalization of the...
An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties
An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties
2008,
In this paper, we consider the single machine scheduling problem with linear earliness...
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
2009,
In this paper, we propose approximate and exact algorithms for the double constrained...
A branch-and-price-and-cut algorithm for the pattern minimization problem
A branch-and-price-and-cut algorithm for the pattern minimization problem
2008,
In cutting stock problems, after an optimal (minimal stock usage) cutting plan has...
Discrepancy-based additive bounding procedures
Discrepancy-based additive bounding procedures
2006,
We model portions of the search tree via so–called search constraints. We focus...
Quantifying the impact of non-adherence to drug therapy: a technical note concerning an application of a branch and bound algorithm
Quantifying the impact of non-adherence to drug therapy: a technical note concerning an application of a branch and bound algorithm
2008,
Pharmacokinetic models typically rely on a key assumption that patients take their...
Papers per page: