The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- A Splicing Approach to Best Subset of Groups Selection (Q74742) (← links)
- A heuristic for nonlinear global optimization (Q120012) (← links)
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method (Q2802241) (← links)
- Growth projections and assortment planning of commodity products across multiple stores: a data mining and optimization approach (Q2802243) (← links)
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244) (← links)
- Linear programming and the control of diffusion processes (Q2802245) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (Q2802247) (← links)
- Achieving domain consistency and counting solutions for dispersion constraints (Q2802248) (← links)
- Cloud computing in space (Q2802249) (← links)
- Machine learning approaches for early DRG classification and resource allocation (Q2802250) (← links)
- A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)
- A progressive hedging approach for surgery planning under uncertainty (Q2802252) (← links)
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis (Q2802253) (← links)
- Optimization of radiation therapy fractionation schedules in the presence of tumor repopulation (Q2802256) (← links)
- Modeling with metaconstraints and semantic typing of variables (Q2806860) (← links)
- A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
- Exploiting binary floating-point representations for constraint propagation (Q2806863) (← links)
- Discrete optimization with decision diagrams (Q2806864) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- Decomposition methods for the parallel machine scheduling problem with setups (Q2806866) (← links)
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (Q2806869) (← links)
- Multilevel optimization modeling for risk-averse stochastic programming (Q2806871) (← links)
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
- Robust critical node selection by Benders decomposition (Q2806873) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Automating bivariate transformations (Q2815424) (← links)
- Transient queueing analysis (Q2815426) (← links)
- Efficient and reliable computation of birth-death process performance measures (Q2815427) (← links)
- An algorithm for fitting heavy-tailed distributions via generalized hyperexponentials (Q2815428) (← links)
- An asymptotic test of optimality conditions in multiresponse simulation optimization (Q2815429) (← links)
- Constraint-based local search for inventory control under stochastic demand and lead time (Q2815430) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- A hybrid heuristic for an inventory routing problem (Q2815432) (← links)
- Shilling attack detection -- a new approach for a trustworthy recommender system (Q2815433) (← links)
- A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
- Computing near-optimal policies in generalized joint replenishment (Q2815435) (← links)
- Computational testing of a separation procedure for the knapsack set with a single continuous variable (Q2815436) (← links)
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints (Q2815438) (← links)
- Core routing on dynamic time-dependent road networks (Q2815439) (← links)
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
- Data-mining-driven neighborhood search (Q2815441) (← links)
- An optimal constraint programming approach to the open-shop problem (Q2815442) (← links)
- Finding all stable pairs and solutions to the many-to-many stable matching problem (Q2815443) (← links)
- An exact method for balancing efficiency and equity in the liver allocation hierarchy (Q2815444) (← links)
- The balanced minimum evolution problem (Q2815445) (← links)
- C-NORTA: a rejection procedure for sampling from the tail of bivariate NORTA distributions (Q2815446) (← links)
- A study of quality and accuracy trade-offs in process mining (Q2815447) (← links)
- An improved branch-and-bound method for maximum monomial agreement (Q2815448) (← links)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
