A Quasi-Polynomial Algorithm for the Knapsack Problem
A solvable case of the set-partitioning problem
A Two-Phase Linear Programming Approach for Redundancy Allocation Problems
A viewpoint to the minimum coloring problem of hypergraphs
Achieving Optimal Design of the Production Line With Obtainable Resource Capacity
Adjacent vertices of the all 0-1 programming polytope
Affectation de véhicules aux routes dans un système de transport multi-école.
Este artículo describe una parte del sistema TRESCA para la organización del transporte escolar en Andorra. Una vez determinadas las rutas a ofrecer, conviene asignarles los vehículos para minimizar los costes. El algoritmo que se ha concebido establece las secuencias de rutas de acuerdo con el modelo de Orloff, con una programación lineal entera y con un subalgoritmo glotón.
Affectation séquentielle de nouvelles machines
Algorithm 14. Initial solution to the zero-one integer linear programming problem
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 51. Solution of linear programming problems in zero-one variables
Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
Amélioration d'un ordonnancement dans le cas d'une fabrication de type linéaire
An Algorithm for a Linear Diophantine Equation and a Problem of Frobenius.
An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.
An algorithm for solving multiple objective integer linear programming problem
In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.
An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
An equivalency problem in discrete programming over ordered semigroups.
An exact method for a discrete multiobjective linear fractional optimization.