The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Guided local search for the three-dimensional bin-packing problem (Q2884559) (← links)
- Combinatorial auctions: a survey (Q2884560) (← links)
- An exact approach to the strip-packing problem (Q2884561) (← links)
- A new genetic algorithm for the quadratic assignment problem (Q2884562) (← links)
- The granular tabu search and its application to the vehicle-routing problem (Q2884563) (← links)
- A reactive variable neighborhood search for the vehicle-routing problem with time windows (Q2884564) (← links)
- Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems (Q2884565) (← links)
- \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau (Q2884566) (← links)
- Execution conditions: a formalization of event cancellation in simulation graphs (Q2884568) (← links)
- The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems (Q2884569) (← links)
- Generating cutting planes for mixed integer programming problems in a parallel computing environment (Q2890402) (← links)
- A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes (Q2890404) (← links)
- A branch-and-cut approach for a generic multiple-product, assembly-system design problem (Q2890406) (← links)
- A new pricing scheme for airline crew scheduling (Q2890408) (← links)
- On bridging the gap between stochastic integer programming and MIP solver technologies (Q2890409) (← links)
- A new formulation and resolution method for the \(p\)-center problem (Q2890410) (← links)
- Scheduling banner advertisements on the web (Q2890412) (← links)
- Implementing an LU factorization for the embedded network simplex algorithm (Q2890413) (← links)
- Computer-aided complexity classification of dial-a-ride problems (Q2890414) (← links)
- An ejection chain approach for the generalized assignment problem (Q2890415) (← links)
- An algorithm to compute the waiting time distribution for the \(M/G/1\) queue (Q2890416) (← links)
- Generalized networks: the theory of preprocessing and an empirical analysis (Q2890417) (← links)
- Wavelength translation in WDM networks: optimization models and solution procedures (Q2890418) (← links)
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem (Q2890419) (← links)
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions (Q2890420) (← links)
- Opportunities for combinatorial optimization in computational biology (Q2890421) (← links)
- DNA sequencing-tabu and scatter search combined (Q2890422) (← links)
- Exploiting tabu search memory in constrained problems (Q2890423) (← links)
- The constraint consensus method for finding approximately feasible points in nonlinear programs (Q2890424) (← links)
- The \(Ph_t/Ph_t/\infty \) queueing system. I: The single node (Q2890425) (← links)
- The \([Ph_{t}/Ph_{t}/\infty ]^{K}\) queueing system. II: The multiclass network (Q2890426) (← links)
- Searching for good multiple recursive random number generators via a genetic algorithm (Q2890427) (← links)
- On a new collection of stochastic linear programming test problems (Q2890428) (← links)
- Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks (Q2890429) (← links)
- A general heuristic for production planning problems (Q2890430) (← links)
- Special issue on computational molecular biology/bioinformatics (Q2890431) (← links)
- Palindromes in SARS and other coronaviruses (Q2890434) (← links)
- Searching for multiple words in a Markov sequence (Q2890435) (← links)
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (Q2890436) (← links)
- Computational problems in noisy SNP and haplotype analysis: block scores, block identification, and population stratification (Q2890437) (← links)
- Global optimization of Morse clusters by potential energy transformations (Q2890438) (← links)
- A semidefinite programming approach to side chain positioning with new rounding strategies (Q2890439) (← links)
- Protein threading: from mathematical models to parallel implementations (Q2890440) (← links)
- Optimizing an empirical scoring function for transmembrane protein structure determination (Q2890442) (← links)
- Optimal solutions for the closest-string problem via integer programming (Q2890443) (← links)
- Multiple sequence alignment as a facility-location problem (Q2890444) (← links)
- Dynamic programming based approximation algorithms for sequence alignment with constraints (Q2890445) (← links)
- The fine structure of galls in phylogenetic networks (Q2890447) (← links)
- Steiner trees and 3-D macromolecular conformation (Q2890449) (← links)
- On the generality of event-graph models (Q2890451) (← links)
