Journal: International Journal of Mathematical Algorithms

Found 10 papers in total
Computational geometry and linear programs
Computational geometry and linear programs
1999,
A collection of linear program (LP) formulations is presented for constructing and...
A multi-product inventory loading problem; a model and a solution method
A multi-product inventory loading problem; a model and a solution method
1999,
An operational inventory problem arises during the transportation and delivery of...
Improving traditional subgradient scheme for Lagrangean relaxation: An application to location problems
Improving traditional subgradient scheme for Lagrangean relaxation: An application to location problems
1999,
Lagrangean relaxation is largely used to solve combinatorial optimization problems. A...
Heuristic algorithms for the single source capacitated facility location problem
Heuristic algorithms for the single source capacitated facility location problem
2000,
Heuristic algorithms for some versions of the single source capacitated facility...
Rectilinear static and dynamic discrete 2-center problems
Rectilinear static and dynamic discrete 2-center problems
2000,
In this paper we consider several variants of the rectilinear discrete 2-center...
Constraint classification, preprocessing and a branch and relax approach to solving mixed integer programming models
Constraint classification, preprocessing and a branch and relax approach to solving mixed integer programming models
2000,
Preprocessing in Integer Programming (IP) is acknowledged to be an analytical as well...
Quadratic set packing problems, Steiner trees, and their integration
Quadratic set packing problems, Steiner trees, and their integration
2000,
The complex problem of designing the layout and location of activities and the flow...
An enhancement of an analytical approach: The case of the weighted maximin network location problem
An enhancement of an analytical approach: The case of the weighted maximin network location problem
2000,
A well known analytical approach which determines an optimal solution for the weighted...
A Lagrangean decomposition for 0–1 hyperbolic programming problems
A Lagrangean decomposition for 0–1 hyperbolic programming problems
2000,
This paper deals with the solution of the 0–1 hyperbolic programming problem...
The Steiner tree problem in graphs: Worst case examples for insertion heuristics
The Steiner tree problem in graphs: Worst case examples for insertion heuristics
1999,
Given a graph G with positive edge costs and a subset R of required vertices, the...
Papers per page: