On the integer max-linear programming problem
نویسندگان
چکیده
منابع مشابه
On the integer max-linear programming problem
For a generic class of matrices we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.
متن کاملInteger linear programming models for the skiving stock problem
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply ofm ∈ N smaller item lengths l1, . . . , lm with availabilities b1, . . . , bm. For this optimization problem, we present three new models (the arcflowmodel, the onestick model...
متن کاملNew Integer Linear Programming Models for the Vertex Coloring Problem
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different from the color of any of its neighbors. The problem is NP-hard. Here, we introduce new integer linear programming formulations based on partial orderings. They have the advantage that they are as simple to work with as t...
متن کاملInteger Linear Programming for the Bayesian network structure learning problem
Bayesian networks are a commonly used method of representing conditional probability relationships between a set of variables in the form of a directed acyclic graph (DAG). Determination of the DAG which best explains observed data is an NP-hard problem [1]. This problem can be stated as a constrained optimisation problem using Integer Linear Programming (ILP). This paper explores how the perfo...
متن کاملInteger Linear Programming Formulation of the Generalized Vehicle Routing Problem
The Generalized Vehicle Routing Problem (GVRP) is an extension of the Vehicle Routing Problem (VRP) defined on a graph in which the nodes (customers, vertices) are grouped into a given number of mutually exclusive and exhaustive clusters (nodesets). In this paper, an integer linear programming formulation of the GVRP with O(n 2 ) binary variables and O(n 2 ) constraints is presented. It is show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.08.007