and heuristic approach which takes advantage of Integer Linear Programming (ILP) techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new set of large sized...

Mixed Integer Programming is a powerful tool to model and solve hard combinatorial optimization problems. Chip design and verification, network design,[1] line planning, frequency assignment, various types

of scheduling and many other...

We develop an integer linear programming technique for solving two variants of the standard vehicle routing problem. Given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given...

an Integer Linear Programming based heuristic method which takes advantage of Integer Linear Programming techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new...

Variable Neighborhood Search scheme, the algorithm incorporates an Integer Linear Programming based improvement method which is applied whenever the heuristic algorithm is not able to improve the quality of the current solution. Extensive computational...

The interval coloring of weighted graph is a general form of the classical graph coloring problem. This problem arises from many situations in the real word problems especially in the scheduling problems. Here, two integer formulations are given...

potential links for bicycle lanes are specified. A model that incorporated integer programming was proposed so that potential links could be ranked considering various budgets using sensitivity analyses. In other words, variables are ranked based on indices...

An optimal unit commitment for electric spot markets is presented in this paper. Unit commitment is a mixed integer and non-linear and complex combinatorial optimization problem which is difficult to be solved for large-scale power systems...