In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. Key-Words: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing. (Forthco...

Binary optimization is a widely investigated topic in integer linear programming. This study proposes a DNA-based computing algorithm for solving the significantly large binary integer programming (BIP) problem. The proposed approach is based upon Adleman and Lipton's DNA operations to solve the BIP problem. The potential of DNA computation for the BIP problem is promising given the operational...

In the rst part of the paper we present a framework for describing basic tech niques to improve the representation of a mixed integer programming problem We elaborate on identi cation of infeasibility and redundancy improvement of bounds and coe cients and xing of binary variables In the second part of the paper we discuss recent extensions to these basic techniques and elaborate on the investi...

Document mentioned in title of this article was published in first version in 2004. In moment research was started version revised on 16.01.2006 was available and this article refers mainly to that version. At this moment newer version revised on 16.10.2006 is available, but main idea is same. This article contains formulation of TSP 2 problem. Then problem is modeled as Integer Linear Programm...

Context: The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, Integer Linear Programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques. Objective: In this ...

Classical retiming optimization algorithnis do not consider circuits containing multiplexers or demultiplexers driven by a clock signal l , because the associated retiming equations differ from the special classical form, which make applicable conibinatorialalgorithnisofpolynomial order. In order to provide an algorithm for multiplexer circuits it is shown here that retiming, being an integer l...

Optimization problems involving two decision makers at two different decision levels are referred to as bilevel programming problems. In this work, we present a novel algorithm for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer quadratic programming problems (B-...

Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with another widely applied paradigm, viz. mixed integer programming. As a theoretical result, we establish translations from non-disjunctive logic programs to linear constraints used i...

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

this paper is focused on the tactical design of steel supply chain (ssc). a general mathematical model is proposed to integrate production and transportation planning in multi-commodity ssc. the main purpose is to prepare a countrywide production and distribution plan in an ssc with three layers consisting of iron ore mines as suppliers, steel companies as producers, and subsidiary steel compan...