Keyword: programming: integer

Found 3058 papers in total
Problem and heuristic space search strategies for job shop scheduling
Problem and heuristic space search strategies for job shop scheduling
1995,
In an earlier paper we discussed ‘problem’ and ‘heuristic’...
Job shop scheduling by local search
Job shop scheduling by local search
1996,
We survey solution methods for the job shop scheduling problem with an emphasis on...
Mixed integer programming for strategic decision support in the slaughter by-product chain
Mixed integer programming for strategic decision support in the slaughter by-product chain
1997,
A mixed integer linear programming model to support strategic decision making is...
Selecting ingot sizes for joint production of sheet products
Selecting ingot sizes for joint production of sheet products
1996,
This paper addresses a tactical planning problem of selecting standard ingot sizes to...
Optimal traffic counting locations for origin–destination matrix estimation
Optimal traffic counting locations for origin–destination matrix estimation
1998,
There has been substantial interest in development and application of methodology for...
Coupling Genetic Algorithm with a grid search method to solve Mixed Integer Nonlinear Programming problems
Coupling Genetic Algorithm with a grid search method to solve Mixed Integer Nonlinear Programming problems
1997,
A new hybrid algorithm is being introduced for solving Mixed Integer Nonlinear...
Ghost image processing for minimum covariance determinants
Ghost image processing for minimum covariance determinants
1995,
In this paper we describe a ghost image processing application to the problem of...
Characterizing a valuated delta-matroid as a family of delta-matroids
Characterizing a valuated delta-matroid as a family of delta-matroids
1997,
Two characterizations are given for a valuated delta-matroid. Let (V, ℱ ) be an...
Art gallery problems for convex nested polygons
Art gallery problems for convex nested polygons
1997,
In this article, we study a class of Art Gallery problems that are defined on a pair...
How much communication does parallel branch and bound need?
How much communication does parallel branch and bound need?
1997,
Consider the classical branch and bound algorithm for mixed integer programming (MIP)....
Solution methods for material requirement planning with lot-size dependent lead times
Solution methods for material requirement planning with lot-size dependent lead times
1998,
A mixed zero–one programming model of an MRP lot-sizing problem whose lead times...
A location based heuristic for general routing problems
A location based heuristic for general routing problems
1995,
We present a general framework for modeling routing problems based on formulating them...
Planning of fuel coal imports using a mixed integer programming method
Planning of fuel coal imports using a mixed integer programming method
1997,
In the public utility and commercial fuel industries, commodities from multiple supply...
An application of genetic and tabu searches to the freight railroad operating plan problem
An application of genetic and tabu searches to the freight railroad operating plan problem
1998,
This paper addresses the joint train-scheduling and demand-flow problem for a major US...
Dynamic expansion and location of an airport: A multiple objective approach
Dynamic expansion and location of an airport: A multiple objective approach
1997,
In this paper we propose a dynamic, multi-objective, mixed integer programming model...
Stowage planning for container ships to reduce the number of shifts
Stowage planning for container ships to reduce the number of shifts
1998,
This paper deals with the stowage plan for containers in a container ship. Containers...
Constraint satisfaction and combinatorial optimization
Constraint satisfaction and combinatorial optimization
1995,
The concept of constraints is the classical tool of the knowledge representation in...
Automatic structural identification and relaxation for integer programming
Automatic structural identification and relaxation for integer programming
1996,
This research investigates the automatic identification of typical embedded structures...
Finding improving directions in Lagrangean relaxation by fictitious play: A NASA scheduling application
Finding improving directions in Lagrangean relaxation by fictitious play: A NASA scheduling application
1996,
An improving direction for Lagrangean dual prices can be found by solving (or solving...
Polyhedral and computational investigations for designing communication networks with high survivability requirements
Polyhedral and computational investigations for designing communication networks with high survivability requirements
1995,
We consider the important practical and theoretical problem of designing a low-cost...
Network configuration and machine layout in fixed-path material handling systems
Network configuration and machine layout in fixed-path material handling systems
1998,
In this paper, we address a difficult combinatorial problem that arises in designing...
A genetic algorithm for discriminant analysis
A genetic algorithm for discriminant analysis
1998,
In this paper we propose a genetic algorithm for discriminant analysis. The genetic...
A mathematical programming approach to data base normalization
A mathematical programming approach to data base normalization
1997,
A critical step in the process of creating a relational data base is normalization,...
Adaptive penalty methods for genetic optimization of constrained combinatorial problems
Adaptive penalty methods for genetic optimization of constrained combinatorial problems
1996,
The application of genetic algorithms (GA) to constrained optimization problems has...
Papers per page: