The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
- Discovery of periodic patterns in sequence data: a variance-based approach (Q2815452) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
- On the prevention of fraud and privacy exposure in process information flow (Q2815456) (← links)
- A branch, bound, and remember algorithm for the simple assembly line balancing problem (Q2815457) (← links)
- A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks (Q2815458) (← links)
- Data structures for higher-dimensional rectilinear packing (Q2815459) (← links)
- Robust optimization in simulation: Taguchi and Krige combined (Q2815461) (← links)
- Coloring graphs using two colors while avoiding monochromatic cycles (Q2815462) (← links)
- Robust software partitioning with multiple instantiation (Q2815463) (← links)
- Quantifying the trade-off between IMRT treatment plan quality and delivery efficiency using direct aperture optimization (Q2815465) (← links)
- The generalized covering salesman problem (Q2815466) (← links)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467) (← links)
- Dividing a territory among several vehicles (Q2815468) (← links)
- The fixed-charge shortest-path problem (Q2815469) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Structural search and optimization in social networks (Q2815472) (← links)
- Finite-sample performance of absolute precision stopping rules (Q2815473) (← links)
- Large-order multiple recursive generators with modulus \(2^{31}-1\) (Q2815474) (← links)
- A mathematical framework for data quality management in enterprise systems (Q2815475) (← links)
- SMART: A stochastic multiscale model for the analysis of energy resources, technology, and policy (Q2815479) (← links)
- Decomposition algorithms for risk-averse multistage stochastic programs with application to water allocation under uncertainty (Q2830943) (← links)
- A game theoretic model for the optimal location of integrated air defense system missile batteries (Q2830945) (← links)
- Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks (Q2830947) (← links)
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling (Q2830948) (← links)
- Iterative refinement for linear programming (Q2830949) (← links)
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
- Improving the integer L-shaped method (Q2830952) (← links)
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds (Q2830953) (← links)
- Modeling and optimization of a spatial detection system (Q2830954) (← links)
- Risk-averse shortest path interdiction (Q2830955) (← links)
- Using GPU computing for solving the two-dimensional guillotine cutting problem (Q2830956) (← links)
- Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set (Q2830957) (← links)
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations (Q2830959) (← links)
- Exact solution methods for a generalized assignment problem with location/allocation considerations (Q2830960) (← links)
- In memoriam: Carl M. Harris (Q2884485) (← links)
- Internet-type queues with power-tailed interarrival times and computational methods for their analysis (Q2884486) (← links)
- A revised simplex search procedure for stochastic simulation response surface optimization (Q2884488) (← links)
- Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting (Q2884489) (← links)
- General open and closed queueing networks with blocking: a unified framework for approximation (Q2884490) (← links)
- Approximation of point sets by 1-corner polygonal chains (Q2884491) (← links)
- Practical piecewise-linear approximation for monotropic optimization (Q2884493) (← links)
- Multiple-machine lower bounds for shop-scheduling problems (Q2884494) (← links)
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study (Q2884495) (← links)
- Fault-tolerant virtual path layout in ATM networks (Q2884496) (← links)
- Representations of the all\_different predicate of constraint satisfaction in integer programming (Q2884497) (← links)
- The bounded cycle-cover problem (Q2884498) (← links)
- Scheduling batches with sequential job processing for two-machine flow and open shops (Q2884499) (← links)
- The online TSP against fair adversaries (Q2884500) (← links)
