The following pages link to Jacobson, Sheldon H. (Q162218):
Displaying 50 items.
- (Q240120) (redirect page) (← links)
- Complexity results for the basic residency scheduling problem (Q398919) (← links)
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- Sequential stochastic assignment under uncertainty: estimation and convergence (Q453780) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- Tabu guided generalized Hill climbing algorithms (Q596519) (← links)
- A multi-attribute approach for setting pediatric vaccine stockpile levels (Q620013) (← links)
- (Q683328) (redirect page) (← links)
- The geo-graph in practice: creating United States congressional districts from census blocks (Q683330) (← links)
- Performance analysis of cyclical simulated annealing algorithms (Q812974) (← links)
- A sensitivity analysis of matching coin game strategies (Q814263) (← links)
- Integer programming models for deployment of airport baggage screening security devices (Q833390) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Extensions of the sequential stochastic assignment problem (Q907377) (← links)
- A mathematical model for assessing the temporal association between health disorders and medical treatments (Q1299443) (← links)
- Optimal mean squared error analysis of the harmonic gradient estimators (Q1321487) (← links)
- Studying the complexity of global verification for NP-hard discrete optimization problems (Q1402543) (← links)
- Computational analysis of a flexible assembly system design problem (Q1572965) (← links)
- Ordinal hill climbing algorithms for discrete manufacturing process design optimization problems (Q1592438) (← links)
- On the convergence of generalized hill climbing algorithms (Q1602702) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- Second derivative estimation using harmonic analysis (Q1805492) (← links)
- Analysis of static simulated annealing algorithms (Q1810929) (← links)
- A class of convergent generalized hill climbing algorithms (Q1855135) (← links)
- Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
- Using an integer programming model to determine the price of combination vaccines for childhood immunization (Q1870406) (← links)
- Scale invariance properties in the simulated annealing algorithm (Q1873831) (← links)
- Designing optimal aviation baggage screening strategies using simulated annealing (Q1885974) (← links)
- Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
- Global optimization performance measures for generalized hill climbing algorithms (Q1888144) (← links)
- A post-optimality analysis algorithm for multi-objective optimization (Q1888156) (← links)
- Analyzing the \(M/M/1\) queue in frequency domain experiments (Q1892072) (← links)
- How difficult is the frequency selection problem? (Q1905076) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
- A sampling procedure to estimate risk probabilities in access-control security systems (Q1971996) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Online total bipartite matching problem (Q2136880) (← links)
- Duality in balance optimization subset selection (Q2158618) (← links)
- Primal-dual analysis for online interval scheduling problems (Q2182859) (← links)
- Two new bidirectional search algorithms (Q2231042) (← links)
- Dynamically improved bounds bidirectional search (Q2238652) (← links)
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← links)
- Variance and bias reduction techniques for the harmonic gradient estimator (Q2365616) (← links)
- Finding preferred subsets of Pareto optimal solutions (Q2427390) (← links)
- An algorithm to solve the proportional network flow problem (Q2448159) (← links)
