The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem (Q2899064) (← links)
- The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment (Q2899066) (← links)
- Algorithms for recognizing economic properties in matrix bid combinatorial auctions (Q2899067) (← links)
- Adaptive auction mechanism design and the incorporation of prior knowledge (Q2899068) (← links)
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme (Q2899069) (← links)
- Solving the order-preserving submatrix problem via integer programming (Q2899070) (← links)
- Algorithms for the bin packing problem with conflicts (Q2899071) (← links)
- On the numerical analysis of inhomogeneous continuous-time Markov chains (Q2899074) (← links)
- The valve location problem in simple network topologies (Q2899077) (← links)
- A dynamic programming decomposition method for making overbooking decisions over an airline network (Q2899078) (← links)
- Least-squares support vector machine approach to viral replication origin prediction (Q2899079) (← links)
- Freedom of privacy: anonymous data collection with respondent-defined privacy protection (Q2899080) (← links)
- Improving the efficiency and efficacy of controlled sequential bifurcation for simulation factor screening (Q2899081) (← links)
- A note on ``A superior representation method for piecewise linear functions'' (Q2899082) (← links)
- Integrated airline schedule design and fleet assignment: polyhedral analysis and Benders' decomposition approach (Q2899083) (← links)
- Incremental satisfiability and implication for UTVPI constraints (Q2899084) (← links)
- Bicriteria \(p\)-hub location problems and evolutionary algorithms (Q2899085) (← links)
- Scalable heuristics for a class of chance-constrained stochastic programs (Q2899086) (← links)
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs (Q2899087) (← links)
- An automated intensity-modulated radiation therapy planning system (Q2899089) (← links)
- Dual-based local search for the connected facility location and related problems (Q2899090) (← links)
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems (Q2899091) (← links)
- The nested event tree model with application to combating terrorism (Q2899092) (← links)
- MRSA transmission reduction using agent-based modeling and simulation (Q2899094) (← links)
- Combining constraint programming and local search for job-shop scheduling (Q2899096) (← links)
- A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem (Q2899099) (← links)
- Decorous lower bounds for minimum linear arrangement (Q2899100) (← links)
- Branch and price for large-scale capacitated hub location problems with single assignment (Q2899101) (← links)
- Branch and price for WDM optical networks with no bifurcation of flow (Q2899102) (← links)
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations (Q2899103) (← links)
- A fully distributed Lagrangean solution for a peer-to-peer overlay network design problem (Q2899105) (← links)
- Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem (Q2899106) (← links)
- Solving talent scheduling with dynamic programming (Q2899107) (← links)
- Why does collaborative filtering work? Transaction-based recommendation model validation and selection by analyzing bipartite random graphs (Q2899108) (← links)
- Algorithms for Coxianization of phase-type generators (Q2899109) (← links)
- Triangular \(M/G/1\)-type and tree-like quasi-birth-death Markov chains (Q2899110) (← links)
- Sequential grid computing: models and computational experiments (Q2899112) (← links)
- Decision support and optimization in shutdown and turnaround scheduling (Q2899113) (← links)
- Resource allocation via message passing (Q2899114) (← links)
- Operating room pooling and parallel surgery processing under uncertainty (Q2899116) (← links)
- An automated and data-driven bidding strategy for online auctions (Q2899117) (← links)
- Computing a classic index for finite-horizon bandits (Q2899118) (← links)
- An efficient and numerically stable method for computing bounds for the interval availability distribution (Q2899119) (← links)
- An algorithm for data envelopment analysis (Q2899120) (← links)
- A parallel algorithm for the vehicle routing problem (Q2899121) (← links)
- A randomized exhaustive propositionalization approach for molecule classification (Q2899124) (← links)
- The knowledge-gradient algorithm for sequencing experiments in drug discovery (Q2899126) (← links)
- A cluster-based context-tree model for multivariate data streams with applications to anomaly detection (Q2899128) (← links)
- A linearly convergent linear-time first-order algorithm for support vector classification with a core set result (Q2899129) (← links)
- Predicting the solution time of branch-and-bound algorithms for mixed-integer programs (Q2899130) (← links)
