Country: Netherlands

Found 18376 papers in total
An efficient, robust method for processing of partial top-k/bottom-k queries using the RD-Tree in online analytical processing (OLAP)
An efficient, robust method for processing of partial top-k/bottom-k queries using the RD-Tree in online analytical processing (OLAP)
2007,
Online analytical processing (OLAP) is a widely used technology for facilitating...
Comparison of the group-buying auction and the fixed pricing mechanism
Comparison of the group-buying auction and the fixed pricing mechanism
2007,
With the development of electronic commerce, online auction plays an important role in...
Decision support for multi-unit combinatorial bundle auctions
Decision support for multi-unit combinatorial bundle auctions
2007,
Single item auctions are by far the most common auction format, but they are not...
Binary Vickrey auction – A robust and efficient multi-unit sealed-bid online auction protocol against buyer multi-identity bidding
Binary Vickrey auction – A robust and efficient multi-unit sealed-bid online auction protocol against buyer multi-identity bidding
2007,
The multi-unit Vickrey–Clark–Groves (VCG) mechanism has two major...
Combinatorial auctions
Combinatorial auctions
2007,
Combinatorial auctions are an important class of market mechanisms in which...
Performance evaluation using data envelopment analysis in the presence of time lags
Performance evaluation using data envelopment analysis in the presence of time lags
2007,
Data Envelopment Analysis (DEA) is a methodology that computes efficiency values for...
Locality of reference and the use of sojourn time variance for measuring queue unfairness
Locality of reference and the use of sojourn time variance for measuring queue unfairness
2007,
Sojourn time variance is widely used as an indication of queue unfairness. We...
Remarks on the remaining service time upon reaching a target level in the M/G/1 queue
Remarks on the remaining service time upon reaching a target level in the M/G/1 queue
2007,
In this note we establish connections between new and previous results on the...
Active constraint set invariancy sensitivity analysis in linear optimization
Active constraint set invariancy sensitivity analysis in linear optimization
2007,
Active constraint set invariancy sensitivity analysis is concerned with finding the...
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
2007,
This paper presents two linear cutting plane algorithms that refine existing methods...
A new lower bound for the non-oriented two-dimensional bin-packing problem
A new lower bound for the non-oriented two-dimensional bin-packing problem
2007,
We propose a new scheme for computing lower bounds for the non-oriented bin-packing...
A new exact method for the two-dimensional bin-packing problem with fixed orientation
A new exact method for the two-dimensional bin-packing problem with fixed orientation
2007,
We propose a new exact method for the well-known two-dimensional bin-packing problem....
On the reformulation of topology optimization problems as linear or convex quadratic mixed 0–1 programs
On the reformulation of topology optimization problems as linear or convex quadratic mixed 0–1 programs
2007,
We consider equivalent reformulations of nonlinear mixed 0–1 optimization...
Optimal stopping problems by two or more decision makers: a survey
Optimal stopping problems by two or more decision makers: a survey
2007,
A review of the optimal stopping problem with more than a single decision maker (DM)...
Characterizations of the optimal stable allocation mechanism
Characterizations of the optimal stable allocation mechanism
2007,
The stable allocation problem is the generalization of (0,1)-matching problems to the...
Global bounds for the distance to solutions of co-coercive variational inequalities
Global bounds for the distance to solutions of co-coercive variational inequalities
2007,
We establish two global bounds measuring the distance from any vector to the solution...
Finding representative systems for discrete bicriterion optimization problems
Finding representative systems for discrete bicriterion optimization problems
2007,
Given a discrete bicriterion optimization problem, we propose two box algorithms to...
On the multi-attribute stopping problem with general value functions
On the multi-attribute stopping problem with general value functions
2007,
We examine a sequential selection problem in which a single option must be selected....
Parameter redundancy in neural networks: an application of Chebyshev polynomials
Parameter redundancy in neural networks: an application of Chebyshev polynomials
2007,
This paper deals with feedforward neural networks containing a single hidden layer and...
An algorithm for node-capacitated ring routing
An algorithm for node-capacitated ring routing
2007,
A strongly polynomial time algorithm is described to solve the node-capacitated...
Colorings of k-balanced matrices and integer decomposition property of related polyhedra
Colorings of k-balanced matrices and integer decomposition property of related polyhedra
2007,
We show that a class of polyhedra, arising from certain 0,1 matrices introduced by...
Optimization with binet matrices
Optimization with binet matrices
2007,
This paper deals with linear and integer programming problems in which the constraint...
NP-hardness of checking the unichain condition in average cost Markov decision processes
NP-hardness of checking the unichain condition in average cost Markov decision processes
2007,
The unichain condition requires that every policy in an MDP result in a single ergodic...
A linear-time algorithm for finding optimal vehicle refueling policies
A linear-time algorithm for finding optimal vehicle refueling policies
2007,
We explore a fixed-route vehicle refueling problem as a special case of the...
Papers per page: