Journal: INFORMS Journal on Computing

Found 247 papers in total
Algorithms for recognizing economic properties in matrix bid combinatorial auctions
Algorithms for recognizing economic properties in matrix bid combinatorial auctions
2010,
A combinatorial auction is an auction where multiple items are for sale simultaneously...
Adaptive auction mechanism design and the incorporation of prior knowledge
Adaptive auction mechanism design and the incorporation of prior knowledge
2010,
Electronic auction markets are economic information systems that facilitate...
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
2010,
In this paper, we present two versions of an algorithm for the computation of all...
Solving the order-preserving submatrix problem via integer programming
Solving the order-preserving submatrix problem via integer programming
2010,
In this paper we consider the order-preserving submatrix (OPSM) problem. This problem...
Algorithms for the bin packing problem with conflicts
Algorithms for the bin packing problem with conflicts
2010,
We consider a particular bin packing problem in which some pairs of items may be in...
On the numerical analysis of inhomogeneous continuous-time Markov chains
On the numerical analysis of inhomogeneous continuous-time Markov chains
2010,
Inhomogeneous continuous-time Markov chains play an important role in different...
The valve location problem in simple network topologies
The valve location problem in simple network topologies
2010,
To control possible spills in liquid or gas transporting pipe systems, the systems are...
A dynamic programming decomposition method for making overbooking decisions over an airline network
A dynamic programming decomposition method for making overbooking decisions over an airline network
2010,
In this paper, we develop a revenue management model to jointly make the capacity...
Least-squares support vector machine approach to viral replication origin prediction
Least-squares support vector machine approach to viral replication origin prediction
2010,
Replication of their DNA genomes is a central step in the reproduction of many...
Freedom of privacy: Anonymous data collection with respondent-defined privacy protection
Freedom of privacy: Anonymous data collection with respondent-defined privacy protection
2010,
The massive amount of sensitive survey data about individuals that agencies collect...
Improving the efficiency and efficacy of controlled sequential bifurcation for simulation factor screening
Improving the efficiency and efficacy of controlled sequential bifurcation for simulation factor screening
2010,
Controlled sequential bifurcation (CSB) is a factor-screening method for...
A superior representation method for piecewise linear functions
A superior representation method for piecewise linear functions
2010,
This paper studies two mixed-integer linear programming (MILP) formulations for...
New optimization model and algorithm for sibling reconstruction from genetic markers
New optimization model and algorithm for sibling reconstruction from genetic markers
2010,
With improved tools for collecting genetic data from natural and experimental...
A class representative model for pure parsimony haplotyping
A class representative model for pure parsimony haplotyping
2010,
Haplotyping estimation from aligned single nucleotide polymorphism fragments has...
A tree search algorithm for solving the container loading problem
A tree search algorithm for solving the container loading problem
2010,
This paper presents a tree search algorithm for the three-dimensional container...
The multidimensional knapsack problem: Structure and algorithms
The multidimensional knapsack problem: Structure and algorithms
2010,
We study the multidimensional knapsack problem, present some theoretical and empirical...
Approximate dynamic programming for ambulance redeployment
Approximate dynamic programming for ambulance redeployment
2010,
We present an approximate dynamic programming approach for making ambulance...
A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
2010,
Hub-and-spoke networks are widely applied in a variety of industries such as...
Path-reduced costs for eliminating arcs in routing and scheduling
Path-reduced costs for eliminating arcs in routing and scheduling
2010,
In many branch-and-price algorithms, the column generation pricing problem consists of...
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
2010,
We develop a solution approach for the fixed-charge network flow (FCNF) problem that...
The uncapacitated time-space fixed-charge network flow problem: An empirical investigation of procedures for arc capacity assignment
The uncapacitated time-space fixed-charge network flow problem: An empirical investigation of procedures for arc capacity assignment
2010,
The nodes and arcs of a network configuration replicated over time is a common...
Merging AI and OR to solve high-dimensional stochastic optimization problems using approximate dynamic programming
Merging AI and OR to solve high-dimensional stochastic optimization problems using approximate dynamic programming
2010,
We consider the problem of optimizing over time hundreds or thousands of discrete...
Convexity and concavity detection in computational graphs: Tree walks for convexity assessment
Convexity and concavity detection in computational graphs: Tree walks for convexity assessment
2010,
We examine symbolic tools associated with two modeling systems for mathematical...
Nonconvex robust optimization for problems with constraints
Nonconvex robust optimization for problems with constraints
2010,
We propose a new robust optimization method for problems with objective functions that...
Papers per page: