The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors (Q4376737) (← links)
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem (Q4376739) (← links)
- Adding Value to Induced Decision Trees for Time-Sensitive Data (Q4376740) (← links)
- An Integrated Modeling System for Structured Modeling Using Model Graphs (Q4376741) (← links)
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows (Q4376742) (← links)
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743) (← links)
- Vector Quantization for Arbitrary Distance Function Estimation (Q4376744) (← links)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (Q4427317) (← links)
- Statistical Analysis of Computational Tests of Algorithms and Heuristics (Q4427318) (← links)
- Parallelizing the Dual Simplex Method (Q4427319) (← links)
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320) (← links)
- A Minimal Algorithm for the Bounded Knapsack Problem (Q4427321) (← links)
- Minmax Regret Median Location on a Network Under Uncertainty (Q4427324) (← links)
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation (Q4427325) (← links)
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management (Q4427326) (← links)
- Algorithms for Path-Based Placement of Inspection Stations on Networks (Q4427327) (← links)
- Selecting Scheduling Heuristics Using Neural Networks (Q4427328) (← links)
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment (Q4427329) (← links)
- Solving Graph Bisection Problems with Semidefinite Programming (Q4427330) (← links)
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances (Q4427331) (← links)
- Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models (Q4427332) (← links)
- A Simplex-Based Tabu Search Method for Capacitated Network Design (Q4427333) (← links)
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem (Q4427334) (← links)
- On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem (Q4427335) (← links)
- Solving the Orienteering Problem through Branch-and-Cut (Q4427336) (← links)
- An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems (Q4427337) (← links)
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems (Q4427339) (← links)
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints (Q4427340) (← links)
- On Formal Semantics and Analysis of Typed Modeling Languages: An Analysis of Ascend (Q4427341) (← links)
- Feature Selection via Mathematical Programming (Q4427342) (← links)
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control (Q4427343) (← links)
- Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs (Q4427344) (← links)
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems (Q4427345) (← links)
- Connections Between Integer Linear Programming and Constraint Logic Programming—An Overview and Introduction to the Cluster of Articles (Q4427346) (← links)
- Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem (Q4427347) (← links)
- Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming (Q4427348) (← links)
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming (Q4427349) (← links)
- An Incremental Branch-and-Bound Method for the Satisfiability Problem (Q4427350) (← links)
- Interval Protection of Confidential Information in a Database (Q4427351) (← links)
- An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull (Q4427352) (← links)
- Online Scheduling with Lookahead: Multipass Assembly Lines (Q4427353) (← links)
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem (Q4427354) (← links)
- An Approximate Analysis of a UNIX Macro Process Scheduler (Q4427356) (← links)
- Localizer: A Modeling Language for Local Search (Q4427357) (← links)
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research (Q4427358) (← links)
- Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results (Q4427359) (← links)
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization (Q4427360) (← links)
- Improvement Procedures for the Undirected Rural Postman Problem (Q4427362) (← links)
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs (Q4427364) (← links)
- Solving Parallel Machine Scheduling Problems by Column Generation (Q4427365) (← links)
