Keyword: programming: branch and bound

Found 862 papers in total
Location of slaughterhouses under economies of scale
2006,
The facility location problem described in this paper comes from an industrial...
The problem of cutting defective boards
2006,
This paper addresses to the two-dimensional cutting problem where a rectangular plate...
Resolution branch and bound and an application: the maximum weighted stable set problem
2007,
We propose a new resolution algorithm, called resolution branch and bound (RBB), where...
Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
2007,
This paper presents a parallel hybrid exact multi-objective approach which combines...
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
2007,
In this paper, we optimally solve the disjunctively constrained knapsack problem...
A new branch and bound method with pretreatment for the binary quadratic programming
2007,
A new branch and bound algorithm with pretreatment for the binary quadratic...
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
2007,
Data collected by statistical agencies may contain mistakes made during the...
Modeling and solving the periodic maintenance problem
2006,
We study the problem of scheduling maintenance services. Given is a set of m machines...
On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
2007,
In this paper a comparison is made between two decomposition techniques to solve a...
A branch-and-price approach for large-scale employee tour scheduling problems
2007,
We present a new methodology for solving large-scale employee tour scheduling...
Branch and price algorithms for production lot sizing
2006,
In this paper, we present two algorithms for the multi-item capacitated lot-sizing...
Product sequencing problem in Mixed-Model Assembly Line to minimize unfinished works
2007,
This study is concerned about how to optimize the input sequence of product models...
A comparison of lower bounds for the single-machine early/tardy problem
2007,
This paper considers the single-machine early/tardy problem. The paper presents a...
On a stochastic sequencing and scheduling problem
2007,
We present a framework for solving multistage pure 0–1 programs for a widely...
An exact method for Pm/sds, ri/∑ni=1Ci problem
2007,
This paper addresses an identical parallel machine scheduling problem, with...
Order acceptance with weighted tardiness
2007,
Over the past decade the strategic importance of order acceptance has been widely...
Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
2007,
This paper presents a parallel hybrid exact multi-objective approach which combines...
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
2007,
The recourse to operation research solutions has strongly increased the performances...
Branch-and-cut algorithms for winner determination in discount auctions
2007,
Discount auction is a procurement mechanism for buying M indivisible heterogeneous...
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
2007,
We consider a monthly crew scheduling problem with preferential bidding in the airline...
A new Dantzig–Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times
2007,
Although the textbook Dantzig–Wolfe decomposition reformulation for the...
Optimizing the quality control station configuration
2007,
We study unreliable serial production lines with known failure probabilities for each...
Flow shop-sequencing problem with synchronous transfers and makespan minimization
2007,
This study considers a permutation flow shop-sequencing problem with synchronous...
Minimizing makespan for two parallel machines with job limit on each availability interval
2007,
We consider the problem of scheduling jobs on two parallel machines that are not...
Papers per page: