Keyword: programming: integer

Found 3058 papers in total
Experience with a cutting plane algorithm for the capacitated spanning tree problem
Experience with a cutting plane algorithm for the capacitated spanning tree problem
1996,
A basic problem in telecommunications network design is that of designing a...
Capacitated network design—polyhedral structure and computation
Capacitated network design—polyhedral structure and computation
1996,
We study a capacity expansion problem that arises in telecommunication network design....
An integer concave minimization approach for the minimum concave capacitated flow problem on networks
An integer concave minimization approach for the minimum concave capacitated flow problem on networks
1998,
Formulating the minimum concave cost capacitated network flow problem as an integer...
A concave function minimization algorithm under 0–1 knapsack constraint using strong valid inequalities
A concave function minimization algorithm under 0–1 knapsack constraint using strong valid inequalities
1997,
The aim of this paper is to develop the B & B type algorithms for globally...
A branch and bound algorithm for solving a capacitated subtree of a tree problem in local access telecommunication networks
A branch and bound algorithm for solving a capacitated subtree of a tree problem in local access telecommunication networks
1997,
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
Revised–modified penalties for fixed charge transportation problems
Revised–modified penalties for fixed charge transportation problems
1997,
Conditional penalties are used to obtain lower bounds to subproblems in a...
A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
1997,
The selective travelling salesperson problem involves determining a tour of maximal...
Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems
Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems
1998,
Mathematical programming models for manufacturing cell formation problems are...
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
1998,
This paper deals with the problem of makespan minimization in a flow shop with two...
A new subtour elimination constraint for the vehicle routing problem
A new subtour elimination constraint for the vehicle routing problem
1996,
Vehicle Routing Problems (VRP) are concerned with the delivery of a single commodity...
SPOT; Scheduling Programs Optimally for Television
SPOT; Scheduling Programs Optimally for Television
1998,
This paper introduces SPOT (Scheduling Programs Optimally for Television), an...
An integrated labor-management system for Taco Bell
An integrated labor-management system for Taco Bell
1998,
Taco Bell Corporation has approximately 6,490 company-owned, licensed, and franchised...
Proctor assignment at Carleton University
Proctor assignment at Carleton University
1998,
Carleton University needs proctors during examination sessions to oversee the students...
Branch and Bound methods for a search problem
Branch and Bound methods for a search problem
1998,
The problem of searching for randomly moving targets such as children and submarines...
Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
1996,
This paper considers the problem of optimally sequencing different car models along an...
A model for medium-term operations planning in an intermodal rail–truck service
A model for medium-term operations planning in an intermodal rail–truck service
1997,
This paper describes a model developed for medium-term operations planning in an...
On the two-level uncapacitated facility location problem
On the two-level uncapacitated facility location problem
1996,
We study the two-level uncapacitated facility location (TUFL) problem. Given two types...
Maximizing the effectiveness of a preventive maintenance system: An adaptive modeling approach
Maximizing the effectiveness of a preventive maintenance system: An adaptive modeling approach
1997,
The dynamic nature of an operating environment, such as machine utilization and...
Using mixed integer programming to design employee rosters
Using mixed integer programming to design employee rosters
1997,
This paper describes the problem of rostering a workforce so as to optimise a weighted...
Component allocation to balance workload in printed circuit card assembly systems
Component allocation to balance workload in printed circuit card assembly systems
1997,
Component allocation in printed circuit card assembly systems is a special case of the...
Dynamic models of production with multiple operations and general processing times
Dynamic models of production with multiple operations and general processing times
1997,
Traditional integer programming model formulations for job-shops and flow-shops do not...
An exact algorithm for project scheduling with multiple modes
An exact algorithm for project scheduling with multiple modes
1997,
We consider an extension of the classical resource-constrained project scheduling...
A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
1995,
A batch sequencing model with sequence-dependent setup-times and -costs is used to...
Optimal scheduling of tasks on identical parallel processors
Optimal scheduling of tasks on identical parallel processors
1995,
We consider the classical problem of scheduling n tasks with given processing time on...
Papers per page: