The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming (Q4427366) (← links)
- Analysis of Stochastic Assembly with GI-Distributed Assembly Time (Q4427367) (← links)
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368) (← links)
- Exact Solution of the Quadratic Knapsack Problem (Q4427369) (← links)
- Computing Minimum-Weight Perfect Matchings (Q4427370) (← links)
- An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network (Q4427372) (← links)
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem (Q4427373) (← links)
- A Computational Study of Search Strategies for Mixed Integer Programming (Q4427374) (← links)
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions (Q4427375) (← links)
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory (Q4427376) (← links)
- A Class of Hard Small 0-1 Programs (Q4427377) (← links)
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine (Q4427378) (← links)
- A Fuzzy Hopfield-Tank Traveling Salesman Problem Model (Q4427379) (← links)
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems (Q4427380) (← links)
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem (Q4427381) (← links)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems (Q4427382) (← links)
- Computing Laplace Transforms for Numerical Inversion Via Continued Fractions (Q4427383) (← links)
- Optimal Integer Solutions to Industrial Cutting Stock Problems (Q4427384) (← links)
- Propagation of Interval Values in Simple Processing Networks (Q4427386) (← links)
- A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
- Spatiotemporally Optimal Fractionation in Radiotherapy (Q4599313) (← links)
- Collaboration Process Pattern Approach to Improving Teamwork Performance: A Data Mining-Based Methodology (Q4599314) (← links)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
- A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Active Learning with Multiple Localized Regression Models (Q4599320) (← links)
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Collaborative Operating Room Planning and Scheduling (Q4599323) (← links)
- Feature Article—Toward an Experimental Method for Algorithm Simulation (Q4888173) (← links)
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances (Q4888174) (← links)
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem (Q4888175) (← links)
- Computation of Derivatives by Means of the Power-Series Algorithm (Q4888176) (← links)
- Localizing and Diagnosing Infeasibilities in Networks (Q4888177) (← links)
- Isomorphic Routing on a Toroidal Mesh (Q4888178) (← links)
- A Comparison of Alternative Approaches for Numerical Solutions of GI/PH/1 Queues (Q4888179) (← links)
- Mathematical Programming for Data Mining: Formulations and Challenges (Q4950941) (← links)
- Data Mining by Decomposition: Adaptive Search for Hypothesis Generation (Q4950942) (← links)
- Direct Marketing Performance Modeling Using Genetic Algorithms (Q4950943) (← links)
- Feature Selection for Financial Credit-Risk Evaluation Decisions (Q4950944) (← links)
- A Study of Composite or Hybrid Classifiers for Knowledge Discovery (Q4950945) (← links)
- Optimizing Expert Systems: Heuristics for Efficiently Generating Low-Cost Information Acquisition Strategies (Q4950946) (← links)
- Parallel Complexity of Additive Location Problems (Q4950947) (← links)
- Semantics-Based Transaction Processing for Real-Time Databases: The Case of Automated Stock Trading (Q4950948) (← links)
- Matrix Sensitivity Analysis from an Interior Solution of a Linear Program (Q4950949) (← links)
- Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies (Q4995051) (← links)
- <tt>SDDP.jl</tt>: A Julia Package for Stochastic Dual Dynamic Programming (Q4995052) (← links)
- High-Performance Prototyping of Decomposition Methods in GAMS (Q4995054) (← links)
