The following pages link to Fred Glover (Q168083):
Displaying 50 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Exact solutions to generalized vertex covering problems: a comparison of two models (Q499689) (← links)
- Tabu search -- uncharted domains (Q537593) (← links)
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems (Q537985) (← links)
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (Q537995) (← links)
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (Q541996) (← links)
- Hybrid scatter tabu search for unconstrained global optimization (Q542001) (← links)
- The case for strategic oscillation (Q542006) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
- A filter-and-fan approach to the 2D HP model of the protein folding problem (Q646723) (← links)
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
- Aggregation of nonnegative integer-valued equations (Q792220) (← links)
- A comparison of pivot selection rules for primal simplex based network codes (Q794141) (← links)
- Evolutionary approaches to DNA sequencing with errors (Q817123) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- A note on xQx as a modelling and solution framework for the linear ordering problem (Q840578) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Dealing with repetitions in sequencing by hybridization (Q883811) (← links)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
- A network-related nuclear power plant model with an intelligent branch- and-bound solution approach (Q917441) (← links)
- A modeling/solution approach for optimal deployment of a weapons arsenal (Q918402) (← links)
- Second-order cover inequalities (Q927162) (← links)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- Infeasible/feasible search trajectories and directional rounding in integer programming (Q930155) (← links)
- A new modeling and solution approach for the number partitioning problem (Q930774) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Contributions of Professor William W. Cooper in operations research and management science (Q1011250) (← links)
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies (Q1037659) (← links)
- The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942) (← links)
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- An extended abstract of an indepth algorithmic and computational study for maximum flow problems (Q1148822) (← links)
- Simple but powerful goal programming models for discriminant problems (Q1150529) (← links)
- (Q1218337) (redirect page) (← links)
- Improved convexity cuts for lattice point problems (Q1218339) (← links)
- First facets of the octahedron (Q1220872) (← links)
- The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
- Linear programming for weighted deviation problems using compact basis techniques (Q1251590) (← links)
