The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- A Network Structural Approach to the Link Prediction Problem (Q3466771) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- Optimal Budget Allocation Across Search Advertising Markets (Q3466774) (← links)
- Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems (Q3466775) (← links)
- Chance Constrained Selection of the Best (Q3466776) (← links)
- Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds (Q3466778) (← links)
- Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach (Q3466780) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra (Q3466783) (← links)
- A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures (Q3466784) (← links)
- State-of-the-Art-Survey—Stochastic Programming: Computation and Applications (Q4354934) (← links)
- OR/SM: A Prototype Integrated Modeling Environment Based on Structured Modeling (Q4354935) (← links)
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm (Q4354936) (← links)
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program (Q4354937) (← links)
- Probabilistic Scaling for the Numerical Inversion of Nonprobability Transforms (Q4354938) (← links)
- Computing Gradients in Large-Scale Optimization Using Automatic Differentiation (Q4354939) (← links)
- An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems (Q4354942) (← links)
- An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators (Q4354943) (← links)
- A Parallel Implementation of the GTH Algorithm (Q4354946) (← links)
- Estimating Waiting Times from Transactional Data (Q4354947) (← links)
- Feature Article—Genetic Algorithms for the Operations Researcher (Q4366461) (← links)
- Placing Text Labels on Maps and Diagrams using Genetic Algorithms with Masking (Q4366463) (← links)
- A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services (Q4366466) (← links)
- A Generalized Univariate Change-of-Variable Transformation Technique (Q4366467) (← links)
- An Implementation of the Batch Means Method (Q4366469) (← links)
- A Parametric Optimization Method for Machine Learning (Q4366470) (← links)
- A Mathematical Programming Approach to Data Base Normalization (Q4367038) (← links)
- How Much Communication Does Parallel Branch and Bound Need? (Q4367039) (← links)
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem (Q4367040) (← links)
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination (Q4367041) (← links)
- On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net (Q4367042) (← links)
- Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences (Q4367043) (← links)
- Toward a Taxonomy of Parallel Tabu Search Heuristics (Q4367044) (← links)
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method (Q4367045) (← links)
- Earliness-Tardiness Scheduling Around Almost Equal Due Dates (Q4367046) (← links)
- Art Gallery Problems for Convex Nested Polygons (Q4367047) (← links)
- Methodology for Stochastic Graph Completion-Time Problems (Q4367048) (← links)
- A Column Generation Approach for Graph Coloring (Q4367049) (← links)
- An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks (Q4367050) (← links)
- Bottleneck Steiner Subnetwork Problems with <i>k</i>-Connectivity Constraints (Q4367051) (← links)
- Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors (Q4367052) (← links)
- An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds (Q4367053) (← links)
- An Implementation of LPFORM (Q4367054) (← links)
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time (Q4367055) (← links)
- On the Laguerre Method for Numerically Inverting Laplace Transforms (Q4367056) (← links)
- Scheduling Periodic Tasks (Q4367057) (← links)
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing (Q4376733) (← links)
- A Branch and Cut Approach for Workload Smoothing on Assembly Lines (Q4376734) (← links)
- Scheduling Periodic Tasks with Slack (Q4376735) (← links)
