We study the resource loading problem, which arises in tactical capacity planning. In this one has to plan intensity of execution a set orders minimize cost function that penalizes use above given limits and completion after their due dates. Our main contributions include novel mixed-integer linear-programming (MIP)‐based formulation, investigation polyhedra associated with feasible assignments...

The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau’s corresponding to feasible and infeasible bases. In this paper, we present an algorithm for approximating the value of the lift-and-project closure. The orig...

Optimization heuristics are often compared with each other to determine which one performs best by means of worst-case performance ratio reflecting the quality of returned solution in the worst case. The domination number is a complement parameter indicating the quality of the heuristic in hand by determining how many feasible solutions are dominated by the heuristic solution. We prove that the...

A surrogate constraint is an inequality implied by the constraints of an integ~r program, and designed to capture useful information that cannot be extra~ted from the parent constraints individually but is nevertheless a consequepce of their conjunction. The use of such constraints as originally propo~ed by the author has recently been extended in an important way by EGON! BALAS and ARTHUR GEOF...

A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of inequalities that describe the two polytopes and the number of variables is doubled. In this paper we show that this is best possible: in every dimension the...

Acknowledgments I wish to extent my sincerest thanks to my advisor Dr. Michalis Zervakis for giving me the opportunity to work under his guidance To my parents for their love and affection To Dr. Costas Balas for providing me with helpful information concerning my case study To everyone else for helping me complete this work KONSTANTINOS E. RAPANTZIKOS

The Three-Index Assignment Problem (AP3) is well-known problem which has been shown to be NP-hard. This problem has been studied extensively, and many exact and heuristic methods have been proposed to solve it. Inspired by the classical assignment problem, we propose a new local search heuristic which solves the problem by simplifying it to the classical assignment problem. We further hybridize...

SECURITY Perrine: The End of crypt() Passwords . . . Please? Wysopal: Learning Security QA from the Vulnerability Researchers Damron: Identifiable Fingerprints in Network Applications Balas: Sebek: Covert Glass-Box Host Analysis Jacobsson & Menczer: Untraceable Email Cluster Bombs Mudge: Insider Threat Singer: Life Without Firewalls Deraison & Gula: Nessus Forte: Coordinated Incident Response P...