Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: Germany
Found
3096 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Further extension of the TSP assign neighborhood
2005,
Glover Fred
We introduce a new extension of Punnen's exponential neighborhood for the traveling...
Dynamics of local search trajectory in traveling salesman problem
2005,
Li Weiqi
This paper investigates dynamics of a local search trajectory generated by running the...
Minimizing makespan and preemption costs on a system of uniform machines
2005,
Woeginger Gerhard J.
It is well known that for preemptive scheduling on uniform machines there exist...
Efficient genetic algorithm based data mining using feature selection with Hausdorff distance
2005,
Piramuthu Selwyn
The development of powerful computers and faster input/output devices coupled with the...
Approximating unknown mappings: An experimental evaluation
2005,
Mart Rafael
Different methodologies have been introduced in recent years with the aim of...
A daily water balance modelling approach for simulating performance of tank-based irrigation systems
2005,
Gowing John
Tanks are small reservoirs, which are widely distributed in South India and Sri Lanka,...
Water balance simulation and economic analysis for optimal size of on-farm reservoir
2005,
Panigrahi B.
Rainfed rice in eastern India suffers frequent moisture stress leading to severe yield...
Optimal management of coastal aquifers using linked simulation optimization approach
2005,
Datta Bithin
Saltwater intrusion management models can be used to derive optimal and efficient...
Principles of cost minimisation in wireless networks
2005,
Grout Vic
This paper considers variations of the minimum connected vertex cover problem to be...
The k-splittable flow problem
2005,
Khler Ekkehard
In traditional multi-commodity flow theory, the task is to send a certain amount of...
An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity
2005,
Romeijn H. Edwin
In this paper, we develop a mathematical programming approach for coordinating...
Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
2005,
Benson H.P.
This article presents an algorithm for globally solving a linear program (P) that...
Complex fractional programming and the Charnes–Cooper transformation
2005,
Schaible S.
We extend the Charnes–Cooper transformation to complex fractional programs...
Modified ratio objective approach in mathematical programming
2005,
Antczak T.
A new approach to obtaining the optimality conditions for fractional mathematical...
Saddle points and Pareto points in multiple objective programming
2005,
Ehrgott Matthias
In this paper relationships between Pareto points and saddle points are studied in...
Interior-point gradient method for large-scale totally nonnegative least squares problems
2005,
Zhang Y.
We study an interior-point gradient method for solving a class of so-called totally...
A note on single alternating cycle neighborhoods for the travelling salesman problem
2005,
Grnert Tore
This paper investigates two different local search approaches for the TSP. Both...
Industrial applications. Optimal design of aircraft structures with damage tolerance requirements
2005,
Arrieta A.J.
Damage tolerance analysis (DTA) was considered in the global design optimization of an...
Bid evaluation in procurement auctions with piecewise linear supply curves
2005,
Ghosh Soumyadip
Consider a marketplace operated by a buyer who wishes to procure large quantities of...
Improved approximations for tour and tree covers
2003,
Sinha Amitabh
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree...
Approximation algorithms for a capacitated network design problem
2003,
Hassin Refael
We study a capacitated network design problem with applications in local access...
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
2004,
Hochbaum Dorit S.
We consider a convex, or nonlinear, separable minimization problem with constraints...
Simple on-line algorithms for the maximum disjoint paths problem
2004,
Kolman Petr
In this paper we study the classical problem of finding disjoint paths in graphs. This...
A branch-checking algorithm for all-pairs shortest paths
2004,
Duin Cees
We formulate and study an algorithm for all-pairs shortest paths in a network with n...
First Page
31
32
33
34
35
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers