Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Early estimates of the size of branch-and-bound trees
2006,
Cornujols Grard
This paper intends to show that the time needed to solve mixed-integer-programming...
An exact approach to the Strip-Packing problem
2003,
Martello Silvano
We consider the problem of orthogonally packing a given set of rectangular items into...
GRASP with path relinking for three-index assignment
2005,
Resende Mauricio G.C.
This paper proposes and tests variants of GRASP (greedy randomized adaptive search...
Solving the generalized assignment problem: An optimizing and heuristic approach
2003,
Nauss Robert M.
The classical generalized assignment problem (GAP) may be stated as finding a...
The distribution of order statistics for discrete random variables with applications to bootstrapping
2006,
Leemis Lawrence M.
An algorithm for computing the PDF of order statistics drawn from discrete parent...
The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning
2006,
Blossom Paul
Introduction to Applied Optimization
2006,
Modi Jamshed A.
Numerical solutions of renewal-type integral equations
2005,
Tortorella Michael
The integral equation of renewal type has many applications in applied probability....
On the generality of event-graph models
2005,
Schruben Lee W.
Event graphs model the dynamics of a discrete-event simulation model. This paper...
Approximation algorithms for the k-source multicast tree construction problem
2006,
Fragopoulou Paraskevi
Given an undirected graph with nonnegative weights on its edges, a group of source...
Approximation algorithms for some k-source shortest paths spanning tree problems
2006,
Wu Bang Ye
In this article, we investigate two spanning tree problems of graphs with k given...
Upgrading arcs to minimize the maximum travel time in a network
2006,
Lowe Timothy J.
In transportation and telecommunication systems, the performance of the underlying...
Exact methods based on node-routing formulations for undirected arc-routing problems
2006,
Maniezzo V.
This article proposes a new transformation of undirected arc-routing problems into...
Steiner trees and 3-D macromolecular conformation
2004,
Smith J. MacGregor
One of the key issues in biochemistry and molecular modelling is the determination of...
An integer programming approach to routing in daisy networks
2006,
Becker Johanna
We are concerned with routing problems arising in special kinds of synchronous digital...
The multiroute maximum flow problem revisited
2006,
Chandrasekaran R.
We are given a directed network G = (V,A,u) with vertex set V , arc set A , a source...
Distributed delay constrained multicast routing algorithm with efficient fault recovery
2006,
Ural Hasan
Existing distributed delay constrained multicast routing algorithms construct a...
A computational study of cost reoptimization for min-cost flow problems
2006,
Frangioni Antonio
In the last two decades, a number of algorithms for the linear single-commodity...
Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
2006,
Powell Warren B.
In this paper, we consider a stochastic and time-dependent version of the min-cost...
Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming
2005,
Sun Minghe
Three warm-start routines are developed to find initial basic feasible solutions for...
Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
2003,
Frangioni Antonio
We study the coarse-grained parallelization of an efficient bundle-based...
A column generation approach for SONET ring assignment
2006,
Maculan Nelson
In this article we consider the SONET ring assignment problem (SRAP). The authors...
Heuristic search for the generalized minimum spanning tree problem
2005,
Golden Bruce
The generalized minimum spanning tree (GMST) problem occurs in telecommunications...
Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
2005,
Jacobson Sheldon H.
This paper introduces simultaneous generalized hill-climbing (SGHC) algorithms as a...
First Page
123
124
125
126
127
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers