|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
RESEARCH REPORTS A Hybrid Multi-Exchange
Local Search for Unconstrained Binary Quadratic Program Evaluating a Clique
Partitioning Problem Model for Clustering
High-Dimensional Data Mining Solving the Maximum Edge
Weight Clique Problem via Unconstrained Quadratic
Programming |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Guided Design Search in
the Interval-bounded Sailor Assignment Problem Guided Design Search in
Joint Capacity Allocation Network Problem A Simple Filter-and-Fan
Approach to the Facility Location Problem Solving fixed charge
capacitated multicommodity network design problem using
guided design search Using quality function
deployment in NAVY manpower planning: A supply chain
management approach Modeling and solving the
task allocation problem as an unconstrained quadratic
binary program A new modeling and
solution approach for the number partitioning problem On the Performance of
Data Structures for the Traveling
Salesman Problem The Satellite List and
New Data Structures for the Symmetric Traveling Salesman
Problem Implementation Analysis
of Efficient Heuristic Algorithms for the Traveling
Salesman Problem Surrogate Branching
Methods for Mixed Integer Programming Solving Combinatorial
Optimization Problems via Reformulation and Adaptive
Memory Metaheuristics
Comparing Sequential and
Joint Mesh Network Capacity Optimization Using An
Experimental Design Approach
An Unconstrained
Quadratic Binary Programming Approach to the Vertex
Coloring Problem
Internet Marketing: An
Overview New Ideas and Applications of Scatter
Search and Path Relinking A
Unified Modeling and
Solution Framework for Combinatorial Optimization
Problems Data
Structures and Ejection Chains for Solving Large-Scale
Traveling Salesman Problems Foundation-Penalty
Cuts for Mixed-Integer Programs Scatter Search and Path Relinking:
Advances and Applications Simultaneous
Data Perturbations and Analytic Center Convergence Manpower Planning and the Optimal Partition Local Search and Metaheuristics for the Traveling
Salesman Problem Detecting the Impact of Including and
Omitting an Attribute in DEA
Nonparametric Frontier Analysis with Multiple Constituencies
An Extension to the Fundamental Theorem of Linear Programming Partitioning Multiple Objective Optimal Solutions with Applications to Radiotherapy Design Node Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms A Scatter Search Algorithm for
the Maximum Clique Problem A Measuring Efficiency with a Linear Economic Model A Scatter Search Tutorial for Graph-Based Permutation Problems One-Pass Heuristics for Large Scale Unconstrained Binary Quadratic Problems Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions Multilevel Cooperative Search: Application to the Circuit/Hypergraph Partitioning Problem Fundamentals of Scatter Search and Path Relinking Greedy Solutions of Selection and Ordering Problems Resolution Search and Dynamic Branch and Bound Reducing the Bandwidth of a Sparse Matrix with Tabu Search On the Selection Issue of the Rau Class of Sequential Problems Looking Back at Edelman Finalist: Lessons Learned Over Time An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem Technical Note on the Paper "An Empirical Study of a New Metaheuristic for The Traveling Salesman Problem" Tabu Search and Finite Convergence. Diversity Data Mining An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem Scatter Search and Path Relinking |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
||||||||||||||||||||||||||||||||||||||||||||||||