Journal: INFORMS Journal On Computing

Found 560 papers in total
The analytic-center cutting-plane method for variational inequalities: A quadratic-cut approach
The analytic-center cutting-plane method for variational inequalities: A quadratic-cut approach
2005,
We introduce a cutting-plane, analytic-center algorithm for strongly monotone...
A column-generation approach to the multiple knapsack problem with color constraints
A column-generation approach to the multiple knapsack problem with color constraints
2006,
In this paper, we study a new problem that we refer to as the multiple knapsack with...
A metastrategy for large-scale resource management based on informational decomposition
A metastrategy for large-scale resource management based on informational decomposition
2006,
This paper addresses the solution of large, complex resource allocation problems,...
LPFML: A W3C XML Schema for linear and integer programming
LPFML: A W3C XML Schema for linear and integer programming
2005,
There are numerous modeling systems for generating linear programs and numerous...
Algorithms for the frame of a finitely generated unbounded polyhedron
Algorithms for the frame of a finitely generated unbounded polyhedron
2006,
Consider two finite sets 𝒜 and 𝒱 of points in m -dimensional space. The...
A set-covering-based heuristic approach for bin-packing problems
A set-covering-based heuristic approach for bin-packing problems
2006,
Several combinatorial optimization problems can be formulated as large set-covering...
Primal–dual-based algorithms for a directed network design problem
Primal–dual-based algorithms for a directed network design problem
2005,
We present efficient algorithms for a special case of network design problems, the...
The granular tabu search and its application to the vehicle-routing problem
The granular tabu search and its application to the vehicle-routing problem
2003,
We describe a new variant, called granular tabu search, of the well-known tabu-search...
A reactive variable neighborhood search for the vehicle-routing problem with time windows
A reactive variable neighborhood search for the vehicle-routing problem with time windows
2003,
The purpose of this paper is to present a new deterministic metaheuristic based on a...
Scheduling banner advertisements on the Web
Scheduling banner advertisements on the Web
2004,
Despite the slowdown in the economy, advertisement revenue remains a significant...
The constraint consensus method for finding approximately feasible points in nonlinear programs
The constraint consensus method for finding approximately feasible points in nonlinear programs
2004,
This paper develops a method for moving quickly and cheaply from an arbitrary initial...
Oblique multicategory decision trees using nonlinear programming
Oblique multicategory decision trees using nonlinear programming
2005,
Induction of decision trees is a popular and effective method for solving...
On a new collection of stochastic linear programming test problems
On a new collection of stochastic linear programming test problems
2004,
The purpose of this paper is to introduce a new test-problem collection for stochastic...
Opportunities for combinatorial optimization in computational biology
Opportunities for combinatorial optimization in computational biology
2004,
This is a survey designed for mathematical programming people who do not know...
DNA sequencing – tabu and scatter search combined
DNA sequencing – tabu and scatter search combined
2004,
In this paper, a tabu-search algorithm enhanced by scatter search is presented. The...
Palindromes in SARS and other coronaviruses
Palindromes in SARS and other coronaviruses
2004,
With the identification of a novel coronavirus associated with the severe acute...
Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms
Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms
2004,
In this paper we address the pure parsimony haplotyping problem: Find a minimum number...
Computational problems in noisy SNP and haplotype analysis: Block scores, block identification, and population stratification
Computational problems in noisy SNP and haplotype analysis: Block scores, block identification, and population stratification
2004,
The study of haplotypes and their diversity in a population is central to...
Global optimization of Morse clusters by potential energy transformations
Global optimization of Morse clusters by potential energy transformations
2004,
The Morse potential is a simple model for the potential energy of atoms with a single...
A semidefinite programming approach to side chain positioning with new rounding strategies
A semidefinite programming approach to side chain positioning with new rounding strategies
2004,
Side chain positioning is an important subproblem of the general...
Protein threading: From mathematical models to parallel implementations
Protein threading: From mathematical models to parallel implementations
2004,
This paper presents a new network-flow formulation for the problem of predicting 3D...
Optimizing an empirical scoring function for transmembrane protein structure determination
Optimizing an empirical scoring function for transmembrane protein structure determination
2004,
We examine the problem of transmembrane protein structure determination. Like many...
Optimal solutions for the closest-string problem via integer programming
Optimal solutions for the closest-string problem via integer programming
2004,
In this paper we study the closest-string problem (CSP), which can be defined as...
Tour merging via branch-decomposition
Tour merging via branch-decomposition
2003,
Robertson and Seymour introduced branch-width as a new connectivity invariant of...
Papers per page: