The following pages link to J. Cole Smith (Q228527):
Displaying 50 items.
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- A parameter optimization heuristic for a temperature estimation model (Q374613) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- (Q724116) (redirect page) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- A packet filter placement problem with application to defense against spoofed denial of service attacks (Q853001) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
- Interleaving two-phased jobs on a single machine (Q1019298) (← links)
- Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. (Q1420448) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159) (← links)
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures (Q1761855) (← links)
- Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks (Q1762081) (← links)
- A class of web-based facets for the generalized vertex packing problem (Q1763480) (← links)
- Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Development of publications and community at the interface between operations research and computing (Q2086523) (← links)
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
- Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
- Algorithms for an integer multicommodity network flow problem with node reliability considerations (Q2247900) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Exact and heuristic algorithms for solving the generalized minimum filter placement problem (Q2369983) (← links)
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms (Q2390998) (← links)
- A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- A multiple-criterion model for machine scheduling (Q2464375) (← links)
- On the multi-attribute stopping problem with general value functions (Q2467472) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm (Q2783895) (← links)
- Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting (Q2884489) (← links)
- An Analysis of the Alias Method for Discrete Random-Variate Generation (Q2890476) (← links)
- Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations (Q2901035) (← links)
- A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures (Q2901069) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning (Q3098265) (← links)
- Improving Discrete Model Representations via Symmetry Considerations (Q3114738) (← links)
- Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths (Q3117319) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
- Organization of a college baseball tournament (Q3395683) (← links)
- An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models (Q3396403) (← links)
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← links)
- A three‐stage procurement optimization problem under uncertainty (Q4629182) (← links)
