The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Optimal synchronization policies for data warehouses (Q2892290) (← links)
- Optimization in object caching (Q2892291) (← links)
- Stockout compensation: joint inventory and price optimization in electronic retailing (Q2892292) (← links)
- Special cluster on computation in music (Q2892293) (← links)
- Mathematical models for tonal induction, approximation, and segmentation using the spiral array (Q2892294) (← links)
- The multilevel capacitated minimum spanning tree problem (Q2892295) (← links)
- A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem (Q2892296) (← links)
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\) (Q2892297) (← links)
- A unified framework for numerically inverting Laplace transforms (Q2892298) (← links)
- Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks (Q2892299) (← links)
- A memetic heuristic for the generalized quadratic assignment problem (Q2892300) (← links)
- Scenario formulation of stochastic linear programs and the homogeneous self-dual interior-point method (Q2892301) (← links)
- Exact algorithms for a loading problem with bounded clique width (Q2892302) (← links)
- Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem (Q2892303) (← links)
- Discrepancy-based additive bounding procedures (Q2892304) (← links)
- FBP: a frontier-based tree-pruning algorithm (Q2892305) (← links)
- Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability (Q2892306) (← links)
- A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints (Q2892307) (← links)
- Setup and open-stacks minimization in one-dimensional stock cutting (Q2892308) (← links)
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem (Q2892309) (← links)
- Performance guarantees of local search for multiprocessor scheduling (Q2892310) (← links)
- Enumeration of Pareto optima for a flowshop scheduling problem with two criteria (Q2892311) (← links)
- Linear complementarity as a general solution method to combinatorial problems (Q2892313) (← links)
- A compressed-annealing heuristic for the traveling salesman problem with time windows (Q2892314) (← links)
- SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization (Q2892315) (← links)
- Simulation allocation for determining the best design in the presence of correlated sampling (Q2892316) (← links)
- Waiting-time distribution of \(M/D_{N}/1\) queues through numerical Laplace inversion (Q2892317) (← links)
- Algorithmic analysis of the maximum queue length in a busy period for the \(M/M/c\) retrial queue (Q2892318) (← links)
- Performance of a wavelet-based spectral procedure for steady-state simulation analysis (Q2892320) (← links)
- An evolutionary random policy search algorithm for solving Markov decision processes (Q2892321) (← links)
- Solving the bi-objective maximum-flow network-interdiction problem (Q2892322) (← links)
- Validation sequence optimization: a theoretical approach (Q2892323) (← links)
- A survey and experimental comparison of service-level-approximation methods for nonstationary \(M(t)/M/s(t)\) queueing systems with exhaustive discipline (Q2892326) (← links)
- ETAQA solutions for infinite Markov processes with repetitive structure (Q2892329) (← links)
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study (Q2892331) (← links)
- Computational assessment of nested Benders and augmented Lagrangian decomposition for mean-variance multistage stochastic problems (Q2892332) (← links)
- Pricing communication services with delay guarantee (Q2892333) (← links)
- GRASP and path relinking for the two-dimensional two-stage cutting-stock problem (Q2892334) (← links)
- Conditions that obviate the no-free-lunch theorems for optimization (Q2892335) (← links)
- Solution of large quadratic knapsack problems through aggressive reduction (Q2892339) (← links)
- An evolutionary metaheuristic for approximating preference-nondominated solutions (Q2892341) (← links)
- Toward automated intelligent manufacturing systems (AIMS) (Q2892342) (← links)
- Efficient computation of overlapping variance estimators for simulation (Q2892343) (← links)
- Scatter search and local NLP solvers: a multistart framework for global optimization (Q2892345) (← links)
- Power algorithms for inverting Laplace transforms (Q2892347) (← links)
- Computing with domino-parity inequalities for the traveling salesman problem (TSP) (Q2892348) (← links)
- An optimization framework for conformal radiation treatment planning (Q2892350) (← links)
- A study on the cross-entropy method for rare-event probability estimation (Q2892351) (← links)
- Denser packings obtained in \(O(n \log \log n)\) time (Q2892352) (← links)
- On a binary-encoded ILP coloring formulation (Q2892353) (← links)
