The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- The bicriterion multimodal assignment problem: introduction, analysis, and experimental results (Q2901023) (← links)
- A maximal-space algorithm for the container loading problem (Q2901024) (← links)
- Tabu search-enhanced graphical models for classification in high dimensions (Q2901025) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem (Q2901027) (← links)
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem (Q2901028) (← links)
- Evaluation of the ARTAFIT method for fitting time-series input processes for simulation (Q2901029) (← links)
- Reactive tabu search in a team-learning problem (Q2901030) (← links)
- Approximation to the transient solution of the \(M/e_{k}/1\) queue (Q2901031) (← links)
- Disk packing in a square: a new global optimization approach (Q2901032) (← links)
- Kestrel: an interface from optimization modeling systems to the NEOS server (Q2901033) (← links)
- Top-\(k\varphi \) correlation computation (Q2901034) (← links)
- Mathematical programming algorithms for two-path routing problems with reliability considerations (Q2901035) (← links)
- An effective deflected subgradient optimization scheme for implementing column generation for large-scale airline crew scheduling problems (Q2901036) (← links)
- A stochastic approximation method to compute bid prices in network revenue management problems (Q2901037) (← links)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes (Q2901038) (← links)
- Beam-ACO for simple assembly line balancing (Q2901039) (← links)
- Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem (Q2901040) (← links)
- Single-machine scheduling problems with generalized preemption (Q2901041) (← links)
- Exact and asymptotically exact solutions for a class of assortment problems (Q2901042) (← links)
- Advanced scatter search for the max-cut problem (Q2901043) (← links)
- Pareto optima of multicriteria integer linear programs (Q2901044) (← links)
- An optimal constrained pruning strategy for decision trees (Q2901047) (← links)
- Minimax regret single-facility ordered median location problems on networks (Q2901048) (← links)
- Efficient correlation matching for fitting discrete multivariate distributions with arbitrary marginals and normal-copula dependence (Q2901049) (← links)
- Extending algebraic modelling languages for stochastic programming (Q2901052) (← links)
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints (Q2901053) (← links)
- Linear-programming-based lifting and its application to primal cutting-plane algorithms (Q2901054) (← links)
- A set-covering approach with column generation for parsimony haplotyping (Q2901055) (← links)
- New exact algorithms for one-machine earliness-tardiness scheduling (Q2901056) (← links)
- Reinforcement learning: a tutorial survey and recent advances (Q2901057) (← links)
- Balanced explorative and exploitative search with estimation for simulation optimization (Q2901059) (← links)
- Efficient computation of sparse hessians using coloring and automatic differentiation (Q2901061) (← links)
- A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators (Q2901062) (← links)
- StAMPL: A filtration-oriented modeling tool for multistage stochastic recourse problems (Q2901063) (← links)
- A complementarity constraint formulation of convex multiobjective optimization problems (Q2901064) (← links)
- Scenario tree-based heuristics for stochastic inventory-routing problems (Q2901065) (← links)
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study (Q2901067) (← links)
- A superior representation method for piecewise linear functions (Q2901068) (← links)
- A dynamic programming algorithm for the generalized minimum filter placement problem on tree structures (Q2901069) (← links)
- Accelerating Benders decomposition by local branching (Q2901070) (← links)
- Grid-enabled optimization with GAMS (Q2901071) (← links)
- Transparent parallelization of constraint programming (Q2901072) (← links)
- Computational experience with a software framework for parallel integer programming (Q2901073) (← links)
- Simultaneous batching and scheduling using dynamic decomposition on a grid (Q2901074) (← links)
- Parallel stochastic global optimization using radial basis functions (Q2901075) (← links)
- Improving bounds on the football pool problem by integer programming and high-throughput computing (Q2901077) (← links)
- Synthetic optimization problem generation: show us the correlations! (Q2901078) (← links)
- A component-based heuristic search method with evolutionary eliminations for hospital personnel scheduling (Q2901079) (← links)
- Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs (Q2901080) (← links)
