Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Marco Trubian
Information about the author Marco Trubian will soon be added to the site.
Found
10 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A relax-and-cut algorithm for the knapsack node weighted Steiner tree problem
2008
The Knapsack Node Weighted Steiner Tree Problem (KNWSTP) is a generalization of the...
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
2005
We consider an extension of the 0–1 multidimensional knapsack problem in which...
A note on the approximation of the asymmetric traveling salesman problem
2004
We show that some asymmetric traveling salesman problem (ATSP) instances are...
Solving the feedback vertex set problem on undirected graphs
2000
Feedback vertex problems consist of removing a minimal number of vertices of a...
Data-dependent bounds for the general and the asymmetric stacker–crane problems
1999
The Stacker–Crane Problem (SCP) is a sequencing problem, arising in scheduling...
Solution of large weighted equicut problems
1998
Given a weighted undirected graph, the equicut problem consists of finding a partition...
New bounds for optimum traffic assignment in satellite communication
1998
In this paper we assume that a satellite has l receiving and transmitting antennas,...
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
1995
Two algorithms are presented for the asymmetric travelling salesman problem. The worst...
Ant system for job-shop scheduling
1994
The study of natural processes has inspired several heuristic optimization algorithms...
Applying tabu search to the job-shop scheduling problem
1993
In this paper, the authors apply the tabu-search technique to the job-shop scheduling...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers