The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Dimension reduction techniques in quasi-Monte Carlo methods for option pricing (Q2901081) (← links)
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem (Q2901082) (← links)
- State-of-the art review-evolutionary algorithms for vehicle routing (Q2901083) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines (Q2940058) (← links)
- A Zig-Zag Approach for Competitive Group Testing (Q2940059) (← links)
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- A Linear-Programming Approximation of AC Power Flows (Q2940062) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations (Q2940065) (← links)
- Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty (Q2940068) (← links)
- Districting for Arc Routing (Q2940070) (← links)
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing (Q2940071) (← links)
- Estimating Sensitivities of Portfolio Credit Risk Using Monte Carlo (Q2940072) (← links)
- Computing the Distribution for the Number of Renewals with Bulk Arrivals (Q2940073) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- Association Rules for Recommendations with Multiple Items (Q2940532) (← links)
- On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators (Q2940533) (← links)
- Effective Active Learning Strategies for the Use of Large-Margin Classifiers in Semantic Annotation: An Optimal Parameter Discovery Perspective (Q2940534) (← links)
- Regression Models Augmented with Direct Stochastic Gradient Estimators (Q2940536) (← links)
- Multiobjective Interacting Particle Algorithm for Global Optimization (Q2940537) (← links)
- Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem (Q2940539) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies (Q2940541) (← links)
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)
- Optimal Implantable Cardioverter Defibrillator (ICD) Generator Replacement (Q2940543) (← links)
- On Convergence Rates of Convex Regression in Multiple Dimensions (Q2940544) (← links)
- A Game-Theoretic Approach to Graph Clustering (Q2940545) (← links)
- The Recoverable Robust Two-Level Network Design Problem (Q2942678) (← links)
- Statistical Database Auditing Without Query Denial Threat (Q2942679) (← links)
- Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups (Q2942680) (← links)
- A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem (Q2942682) (← links)
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs (Q2942683) (← links)
- On Bounding the Bandwidth of Graphs with Symmetry (Q2942684) (← links)
- Solving Hierarchical Stochastic Programs: Application to the Maritime Fleet Renewal Problem (Q2942685) (← links)
- Maintaining Secure and Reliable Distributed Control Systems (Q2942687) (← links)
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem (Q2942688) (← links)
- A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines (Q2942689) (← links)
- New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem (Q2942691) (← links)
- Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks (Q2942692) (← links)
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets (Q2942693) (← links)
- (<i>s</i>, <i>S</i>) Inventory Systems with Correlated Demands (Q2960355) (← links)
- Automated Multilateral Negotiation on Multiple Issues with Private Information (Q2960357) (← links)
- Efficient VaR and CVaR Measurement via Stochastic Kriging (Q2960358) (← links)
- Convex Relaxations for Gas Expansion Planning (Q2960359) (← links)
- The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
