Keyword: programming: integer

Found 3058 papers in total
Clustering techniques for stock location and order-picking in a distribution center
Clustering techniques for stock location and order-picking in a distribution center
1999,
In this paper, the stock location and order-picking problems in a distribution center...
Dependent-chance integer programming applied to capital budgeting
Dependent-chance integer programming applied to capital budgeting
1999,
This paper attempts to model capital budgeting problems by a new technique of...
A repeated matching heuristic for the single-source capacitated facility location problem
A repeated matching heuristic for the single-source capacitated facility location problem
1999,
Facility location models form an important class of integer programming problems, with...
Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem
Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem
1999,
This paper considers the Single Source Capacitated Plant Location Problem (SSCPLP)....
A closed-loop logistics model for remanufacturing
A closed-loop logistics model for remanufacturing
1999,
Recoverable product environments are becoming an increasingly important segment of the...
A zero–one model for project portfolio selection and scheduling
A zero–one model for project portfolio selection and scheduling
1999,
A zero–one integer linear programming model is proposed for selecting and...
Lagrangian relaxation approach to the targeting problem
Lagrangian relaxation approach to the targeting problem
1999,
In this paper, we consider a new weapon–target allocation problem with the...
Heuristic algorithms for the portfolio selection problem with minimum transaction lots
Heuristic algorithms for the portfolio selection problem with minimum transaction lots
1999,
The problem of selecting a portfolio has been largely faced in terms of minimizing the...
Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
1999,
In the present paper, we invoke a newly developed genetic hybrid algorithm (GHA) to...
A production–transportation problem with stochastic demand and concave production costs
A production–transportation problem with stochastic demand and concave production costs
1999,
Well known extensions of the classical transportation problem are obtained by...
On the complexity of postoptimality analysis of 0/1 programs
On the complexity of postoptimality analysis of 0/1 programs
1999,
In this paper we address the complexity of postoptimality analysis of 0/1 programs...
Linear ordering of the vertices of a partially ordered hypergraph and applications
Linear ordering of the vertices of a partially ordered hypergraph and applications
1997,
We first deal with the problem which consists in finding a linear ordering of the...
A competitive local search heuristic for the subset sum problem
A competitive local search heuristic for the subset sum problem
1999,
Subset sum problems are a special class of difficult singly constrained zero–one...
Integer solutions of multicriteria network flow problems
Integer solutions of multicriteria network flow problems
1999,
This paper is concerned with the solution of integer multicriteria network flow...
Resource allocation problem based on the data envelopment analysis model
Resource allocation problem based on the data envelopment analysis model
1999,
In this paper, we propose a method for the resource allocation problems based on data...
A fast interactive solution method for large capital expenditure selection problems
A fast interactive solution method for large capital expenditure selection problems
1999,
In many capital expenditure planning problems, a large number of alternatives compete...
A branch and bound algorithm for solving mean–risk–skewness portfolio models
A branch and bound algorithm for solving mean–risk–skewness portfolio models
1998,
This paper discusses an efficient algorithm for solving the mean–absolute...
Lifted cover inequalities for 0–1 integer programs: Complexity
Lifted cover inequalities for 0–1 integer programs: Complexity
1999,
We investigate several complexity issues related to branch-and-cut algorithms for...
Reserve design for species preservation
Reserve design for species preservation
1999,
The problem of designing a natural area reserve for the preservation of species is...
Compliance based mixed integer programming model and heuristic for support layout optimization
Compliance based mixed integer programming model and heuristic for support layout optimization
1999,
Machining-fixture supports are used to increase workpiece rigidity. A critical problem...
Inventory control on sequences of links with given transportation frequencies
Inventory control on sequences of links with given transportation frequencies
1999,
This paper deals with the problem of minimizing the sum of the inventory and...
Separating lifted odd-hole inequalitites to solve the index selection problem
Separating lifted odd-hole inequalitites to solve the index selection problem
1999,
The Index Selection Problem (ISP) is a phase of fundamental importance in the physical...
An exact algorithm for the capacitated facility location problems with single sourcing
An exact algorithm for the capacitated facility location problems with single sourcing
1999,
Facility location problems are often encountered in many areas such as distribution,...
Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
1999,
This paper presents exact and heuristic solution procedures for a multiproduct...
Papers per page: