The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Meta-heuristics for a class of demand-responsive transit systems (Q2890452) (← links)
- Oblique multicategory decision trees using nonlinear programming (Q2890453) (← links)
- A GRASP for parallel machine scheduling with time windows (Q2890455) (← links)
- Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem (Q2890456) (← links)
- Numerical solutions of renewal-type integral equations (Q2890457) (← links)
- A two-moment approximation for the \(GI/G/c\) queue with finite capacity (Q2890458) (← links)
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459) (← links)
- Optimal processing policies for an e-commerce web server (Q2890460) (← links)
- Context-independent scatter and tabu search for permutation problems (Q2890461) (← links)
- An experimental study of LP-based approximation algorithms for scheduling problems (Q2890462) (← links)
- LPFML: A W3C XML schema for linear and integer programming (Q2890463) (← links)
- Primal-dual-based algorithms for a directed network design problem (Q2890464) (← links)
- Using extra dual cuts to accelerate column generation (Q2890465) (← links)
- Near-optimal solutions of large-scale single-machine scheduling problems (Q2890466) (← links)
- The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach (Q2890467) (← links)
- Designing communication networks to decompose network control problems (Q2890468) (← links)
- GRASP with path relinking for three-index assignment (Q2890469) (← links)
- A new pricing model for competitive telecommunications services using congestion discounts (Q2890470) (← links)
- State-of-the-art review: a user's guide to the brave new world of designing simulation experiments (Q2890472) (← links)
- Heuristic search for the generalized minimum spanning tree problem (Q2890473) (← links)
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop (Q2890475) (← links)
- An analysis of the alias method for discrete random-variate generation (Q2890476) (← links)
- A general purpose algorithm for three-dimensional packing (Q2890477) (← links)
- Laying out sparse graphs with provably minimum bandwidth (Q2890478) (← links)
- Effective role resolution in workflow management (Q2890479) (← links)
- A modeling layer for constraint-programming libraries (Q2892256) (← links)
- Planar branch decompositions. I: The ratcatcher (Q2892257) (← links)
- Planar branch decompositions. II: The cycle method (Q2892258) (← links)
- Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming (Q2892259) (← links)
- Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems (Q2892260) (← links)
- The minmax relative regret median problem on networks (Q2892261) (← links)
- Isotonic separation (Q2892263) (← links)
- A heuristic for winner determination in rule-based combinatorial auctions (Q2892265) (← links)
- An automated multiresolution procedure for modeling complex arrival processes (Q2892267) (← links)
- The distribution of order statistics for discrete random variables with applications to bootstrap\-ping (Q2892268) (← links)
- Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems (Q2892269) (← links)
- A metastrategy for large-scale resource management based on informational decomposition (Q2892270) (← links)
- A computational study of cost reoptimization for min-cost flow problems (Q2892272) (← links)
- A set-covering-based heuristic approach for bin-packing problems (Q2892273) (← links)
- Early estimates of the size of branch-and-bound trees (Q2892274) (← links)
- Algorithms for the frame of a finitely generated unbounded polyhedron (Q2892275) (← links)
- A new mathematical-programming framework for facility-layout design (Q2892276) (← links)
- An improved augmented neural-network approach for scheduling problems (Q2892277) (← links)
- A column-generation approach to the multiple knapsack problem with color constraints (Q2892278) (← links)
- Integer linear programming models for global routing (Q2892279) (← links)
- Task scheduling in a finite-resource, reconfigurable hardware/software codesign environment (Q2892281) (← links)
- A projection-based reduction approach to computing sensitivity of steady-state response of nonlinear circuits (Q2892286) (← links)
- Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits (Q2892287) (← links)
- Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates (Q2892288) (← links)
- Modeling and performance analysis of a finite-buffer queue with batch arrivals, batch services, and setup times: the \(M^{X}/G^{Y}/1/K + B\) queue with setup times (Q2892289) (← links)
