Country: Netherlands

Found 18376 papers in total
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
2005,
We give a simple O( n 3/2 log n ) algorithm for finding a minimum weight odd circuit...
Another greedy heuristic for the constrained forest problem
Another greedy heuristic for the constrained forest problem
2005,
The constrained forest problem seeks a minimum-weight spanning forest in an undirected...
Hybrid approaches for classification under information acquisition cost constraint
Hybrid approaches for classification under information acquisition cost constraint
2005,
We address a problem of classification with information acquisition cost constraint...
Two-connected Steiner networks: structural properties
Two-connected Steiner networks: structural properties
2005,
We give a number of structural results for the problem of constructing a...
Random waypoint model in n-dimensional space
Random waypoint model in n-dimensional space
2005,
The random waypoint model (RWP) is one of the most widely used mobility models in...
Optimal inventory policy with noninstantaneous receipt under trade credit
Optimal inventory policy with noninstantaneous receipt under trade credit
2005,
In the last two decades, the models for inventory replenishment policies under trade...
A practical inventory control policy using operational statistics
A practical inventory control policy using operational statistics
2005,
Consider the newsvendor inventory control problem with an ambiguous demand. The...
On-line scheduling to minimize maximum flow time: an optimal preemptive algorithm
On-line scheduling to minimize maximum flow time: an optimal preemptive algorithm
2005,
We investigate the maximum flow time minimization problem of on-line scheduling jobs...
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
2005,
A polygreedoid and a poly-antimatroid are the generalization of a greedoid and an...
A new algorithm for one-warehouse multi-retailer systems under stationary nested policy
A new algorithm for one-warehouse multi-retailer systems under stationary nested policy
2006,
This study aims at optimally coordinating inventory among all the partners in a supply...
A labeling method for dynamic driver-task assignment with uncertain task durations
A labeling method for dynamic driver-task assignment with uncertain task durations
2005,
The problem of assigning drivers to cover tasks with service time windows and...
Robust profit opportunities in risky financial portfolios
Robust profit opportunities in risky financial portfolios
2005,
For risky financial securities with given expected return vector and covariance...
Applying possibilistic linear programming to aggregate production planning
Applying possibilistic linear programming to aggregate production planning
2005,
This work presents a novel interactive possibilistic linear programming (PLP) approach...
Cover and pack inequalities for (mixed) integer programming
Cover and pack inequalities for (mixed) integer programming
2005,
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer...
On the exponential cardinality of FDS for the ordered p-median problem
On the exponential cardinality of FDS for the ordered p-median problem
2005,
We study finite dominating sets (FDS) for the ordered median problem. This kind of...
Depth-optimized convexity cuts
Depth-optimized convexity cuts
2005,
This paper presents a general, self-contained treatment of convexity or intersection...
About Lagrangian methods in integer optimization
About Lagrangian methods in integer optimization
2005,
It is well-known that the Lagrangian dual of an Integer Linear Program (ILP) provides...
Contingency management under asymmetric information
Contingency management under asymmetric information
2005,
We model a monopolist supplier whose supply to multiple buyers is disrupted. The...
The multidimensional 0–1 knapsack problem – bounds and computational aspects
The multidimensional 0–1 knapsack problem – bounds and computational aspects
2005,
The multidimensional 0–1 knapsack problem (MKP) is a resource allocation model...
Matching intermediaries for information goods in the presence of direct search: an examination of switching costs and obsolescence of information
Matching intermediaries for information goods in the presence of direct search: an examination of switching costs and obsolescence of information
2005,
This paper investigates patterns of revenues earned by an intermediary that matches...
A conditional logic approach for strengthening mixed 0–1 linear programs
A conditional logic approach for strengthening mixed 0–1 linear programs
2005,
We study a conditional logic approach for tightening the continuous relaxation of a...
Classical cuts for mixed-integer programming and branch-and-cut
Classical cuts for mixed-integer programming and branch-and-cut
2005,
We review classical valid linear inequalities for mixed-integer programming, i.e.,...
An adapted step size algorithm for a 0–1 biknapsack Lagrangean dual
An adapted step size algorithm for a 0–1 biknapsack Lagrangean dual
2005,
This paper deals with a new algorithm for a 0–1 bidimensional knapsack...
On compact formulations for integer programs solved by column generation
On compact formulations for integer programs solved by column generation
2005,
Column generation has become a powerful tool in solving large scale integer programs....
Papers per page: