The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Properties of batched quadratic-form variance parameter estimators for simulations (Q2884501) (← links)
- Non-approximability results for scheduling problems with minsum criteria (Q2884502) (← links)
- Addendum to ``Presolve analysis of linear programs prior to applying an interior point method'' (Q2884503) (← links)
- Modeling and analysis of discrete-time multiserver queues with batch arrivals: \(GI^{X}/geom/m\) (Q2884504) (← links)
- The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis (Q2884505) (← links)
- A parallel, linear programming-based heuristic for large-scale set partitioning problems (Q2884506) (← links)
- Fast heuristics for the maximum feasible subsystem problem (Q2884507) (← links)
- Sorting permutations by reversals through branch-and-price (Q2884508) (← links)
- On the design problem of multitechnology networks (Q2884509) (← links)
- Algorithms for hybrid MILP/CP models for a class of optimization problems (Q2884510) (← links)
- The semismooth algorithm for large scale complementarity problems (Q2884511) (← links)
- Initialization for NORTA: generation of random vectors with specified marginals and correlations (Q2884512) (← links)
- A dynamic programming based pruning method for decision trees (Q2884515) (← links)
- Phantom harmonic gradient estimators for nonpreemptive priority queueing systems (Q2884516) (← links)
- Technical note on ``Optimal integer solutions to industrial cutting stock problems'' by Degraeve and Schrage (Q2884517) (← links)
- Ranking and selection for steady-state simulation: procedures and perspectives (Q2884519) (← links)
- A MINSAT approach for learning in logic domains (Q2884520) (← links)
- Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem (Q2884522) (← links)
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem (Q2884524) (← links)
- Assembly-line scheduling with concurrent operations and parallel machines (Q2884525) (← links)
- Minimax models for diverse routing (Q2884526) (← links)
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance (Q2884527) (← links)
- Calculating the distribution of a linear combination of uniform order statistics (Q2884529) (← links)
- Solution of a min-max vehicle routing problem (Q2884530) (← links)
- Minimizing the average query complexity of learning monotone Boolean functions (Q2884531) (← links)
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532) (← links)
- Optimization for simulation: theory vs. practice (Q2884533) (← links)
- A hybrid GRASP with perturbations for the Steiner problem in graphs (Q2884534) (← links)
- Capacitated network design with uncertain demand (Q2884535) (← links)
- Symbolic computation of moments in priority queues (Q2884536) (← links)
- An evolutionary approach to group decision making (Q2884537) (← links)
- Special issue on the merging of mathematical programming and constraint programming (Q2884538) (← links)
- Logic, optimization, and constraint programming (Q2884539) (← links)
- Extending an algebraic modeling language to support constraint programming (Q2884540) (← links)
- Constraint and integer programming in OPL (Q2884541) (← links)
- Efficient intelligent backtracking using linear programming (Q2884543) (← links)
- The role of integer programming techniques in constraint programming's global constraints (Q2884544) (← links)
- A hybrid exact algorithm for the TSPTW (Q2884545) (← links)
- A genetic algorithm-based approach for building accurate decision trees (Q2884546) (← links)
- A linear programming approach to discriminant analysis with a reserved-judgment region (Q2884547) (← links)
- A multicommodity network-flow problem with side constraints on paths solved by column generation (Q2884548) (← links)
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results (Q2884549) (← links)
- Chained Lin-Kernighan for large traveling salesman problems (Q2884550) (← links)
- The reversal median problem (Q2884551) (← links)
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming (Q2884552) (← links)
- Special issue on mining web-based data for e-business applications. (Q2884553) (← links)
- A framework for the evaluation of session reconstruction heuristics in web-usage analysis (Q2884555) (← links)
- Relationship-based clustering and visualization for high-dimensional data mining (Q2884556) (← links)
- Tour merging via branch-decomposition (Q2884557) (← links)
- Solving the generalized assignment problem: an optimizing and heuristic approach (Q2884558) (← links)
