Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: optimization
Found
2864 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Stochastic pension funding when the benefit and the risky asset follow jump diffusion processes
2012,
Rincn-Zapatero Juan Pablo
We study the asset allocation of defined benefit pension plans of the type designed...
Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods
2012,
Fouskakis D
In this paper the usage of a stochastic optimization algorithm as a model search tool...
Preference elicitation from inconsistent judgments using multi‐objective optimization
2012,
Siraj S
Several decision‐making techniques involve pairwise comparisons to elicit the...
The eye and the fist: Optimizing search and interdiction
2012,
Kress M
Interdiction operations involving search, identification, and interception of...
Perfect matchings in paired domination vertex critical graphs
2012,
Kang Liying
A vertex subset S of a graph G =( V , E ) is a paired dominating set if every vertex...
Optimization incentive and relative riskiness in experimental stag‐hunt games
2012,
Dubois D
We compare the experimental results of three stag‐hunt games. In contrast to...
A Linear Algorithm for the Random Sampling from Regular Languages
2012,
Bernardi Olivier
We present the first linear algorithm for the random sampling from regular languages....
A dynamic programming approach for agent's bidding strategy in TAC‐SCM game
2012,
Sibdari Soheil
Intelligent agents have been developed for a number of e‐commerce applications...
Pruning 2‐Connected Graphs
2012,
Chekuri Chandra
Given an undirected graph G with edge costs and a specified set of terminals, let the...
Aligning Two Convex Figures to Minimize Area or Perimeter
2012,
Ahn Hee-Kap
Given two compact convex sets P and Q in the plane, we consider the problem of finding...
A Note on Bar‐Gera's Algorithm for the Origin‐Based Traffic Assignment Problem
2012,
Nie Yu (Marco)
Recently, Bar-Gera (2002) proposed a quasi-Newton method for the origin-based...
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
2000,
Brandes U
Given a graph G=(V,E) and two vertices s,t ∈V , s eq t , the Menger problem is to...
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
2000,
Djidjev H N
We prove separator theorems in which the size of the separator is minimized with...
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem
2002,
Sanchis L A
We say a vertex v in a graph G covers a vertex w if v=w or if v and w are adjacent. A...
Mutual impacts of product standardization and supply chain design
2012,
Penz Bernard
This paper deals with two major issues for industries; the product design and the...
Production planning of a hybrid manufacturing–remanufacturing system under uncertainty within a closed‐loop supply chain
2012,
Dejax Pierre
This paper deals with the production planning and control of a single product...
Discount pricing for a family of items: The supplier's optimal decisions
2012,
Ke Ginger Y
Consider a family of SKUs for which the supplier will offer a quantity discount,...
Assuring finite moments for willingness to pay in random coefficient models
2012,
Daly Andrew
Random coefficient models such as mixed logit are increasingly being used to allow for...
Testing the Quality ofManufactured Disks and Balls
2004,
Bose Prosenjit
We consider the problem of testing the roundness of manufactured disks and balls using...
Approximate Matching of Run‐Length Compressed Strings
2003,
Mkinen
We focus on the problem of approximate matching of strings that have been compressed...
Lower tolerance‐based Branch and Bound algorithms for the ATSP
2012,
Goldengorin Boris
In this paper, we develop a new tolerance‐based Branch and Bound algorithm for...
On the Competitive Theory and Practice of Online List Accessing Algorithms
2002,
Bachrach
This paper concerns the online list accessing problem. In the first part of the paper...
A Divide‐and‐Conquer Approach to the Minimum k ‐Way Cut Problem
2002,
Kamidoi
This paper presents algorithms for computing a minimum 3 ‐way cut and a minimum...
Improved Algorithms for Constructing Fault‐Tolerant Spanners
2002,
Levcopoulos
Let S be a set of n points in a metric space, and let k be a positive integer....
First Page
48
49
50
51
52
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers