The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model (Q2892354) (← links)
- A decomposition and guided simulation methodology for large-scale system design: a study in QoS-capable intranets with fixed and mobile components (Q2892355) (← links)
- A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows (Q2892357) (← links)
- Tariff optimization in networks (Q2892359) (← links)
- On the selection of the globally optimal prototype subset for nearest-neighbor classification (Q2892360) (← links)
- Efficient computations for the discrete \(GI/G/1\) system (Q2892361) (← links)
- Constructing ensembles from data envelopment analysis (Q2892362) (← links)
- A stochastic radial basis function method for the global optimization of expensive functions (Q2892363) (← links)
- An evolutionary algorithm for polishing mixed integer programming solutions (Q2892364) (← links)
- On the distributed Bellman-Ford algorithm and the looping problem (Q2892366) (← links)
- Primal-dual variable neighborhood search for the simple plant-location problem (Q2892367) (← links)
- A traffic-grooming algorithm for wavelength-routed optical networks (Q2892368) (← links)
- Asynchronous cooperative local search for the office-space-allocation problem (Q2892369) (← links)
- Multi-issue automated negotiations using agents (Q2892370) (← links)
- A \((2/3)n^{3}\) fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain (Q2892371) (← links)
- Dynamic programming to minimize the maximum number of open stacks (Q2892372) (← links)
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading (Q2892373) (← links)
- Rescheduling for multiple new orders (Q2892374) (← links)
- Very large-scale neighborhood search for the quadratic assignment problem (Q2892376) (← links)
- A constraint programming approach for solving a queueing design and control problem (Q2899022) (← links)
- An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy (Q2899023) (← links)
- An encoding in metaheuristics for the minimum communication spanning tree problem (Q2899024) (← links)
- The knowledge-gradient policy for correlated normal beliefs (Q2899025) (← links)
- An algorithm and a core set result for the weighted Euclidean one-center problem (Q2899026) (← links)
- Transforming renewal processes for simulation of nonstationary arrival processes (Q2899028) (← links)
- Numerically safe Gomory mixed-integer cuts (Q2899029) (← links)
- Merging AI and OR to solve high-dimensional stochastic optimization problems using approximate dynamic programming (Q2899030) (← links)
- Commentary: Perspectives on stochastic optimization over time (Q2899031) (← links)
- Commentary: Post-decision states and separable approximations are powerful tools of approximate dynamic programming (Q2899032) (← links)
- Rejoinder-the languages of stochastic optimization (Q2899033) (← links)
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment (Q2899035) (← links)
- Nonconvex robust optimization for problems with constraints (Q2899036) (← links)
- Sequential sampling to myopically maximize the expected value of information (Q2899037) (← links)
- An algorithm for fast generation of bivariate Poisson random vectors (Q2899039) (← links)
- A generalized Wedelin heuristic for integer programming (Q2899041) (← links)
- Pruning moves (Q2899042) (← links)
- Setting the research agenda in automated timetabling: the second international timetabling competition (Q2899043) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- Feasibility and constraint analysis of sets of linear matrix inequalities (Q2899045) (← links)
- Binarized support vector machines (Q2899046) (← links)
- Exact algorithms for the quadratic linear ordering problem (Q2899047) (← links)
- New optimization model and algorithm for sibling reconstruction from genetic markers (Q2899050) (← links)
- A class representative model for pure parsimony haplotyping (Q2899051) (← links)
- TreeHugger: a new test for enrichment of gene ontology terms (Q2899054) (← links)
- A tree search algorithm for solving the container loading problem (Q2899056) (← links)
- Two-step MIR inequalities for mixed integer programs (Q2899057) (← links)
- The multidimensional knapsack problem: structure and algorithms (Q2899058) (← links)
- Approximate dynamic programming for ambulance redeployment (Q2899060) (← links)
- A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion (Q2899062) (← links)
- Path-reduced costs for eliminating arcs in routing and scheduling (Q2899063) (← links)
