Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"0 - 1 Integer programming"”.
-
Heuristic algorithm for solving economic models formulated as 0-1 integer programming problems, A
Includes bibliographical references (pages 74-78).
-
INVESTIGATING THE EXACT EFFECTIVENESS OF CUTTING PLANES OVER BRANCH-AND-BOUND IN INTEGER PROGRAMMING
… to branch-and-cut (BC) techniques in convex 0/1 integer programming under variable disjunctions, with a focus on the three-dimensional setting. We prove that for a range of three-dimensional convex 0/1 integer programming problems, any valid inequality established by a BC proof tree can be …
-
Formulating the Rotating Workforce Scheduling Problem with Applications to Police Rostering
… Rotating Workforce Scheduling Problem. The 0-1 integer programming (IP) formulation seeks to maximize the number of nonworking (free) weekends while enforcing constraints based on the minimum staffing levels for each shift on each given day, minimum and maximum limits on the length of work and …
-
Project portfolio evaluation and selection using mathematical programming and optimization methods
… portfolio selection tool by using mathematical programming and optimization models, specifically 0-1 integer programming (one objective portfolio) and goal programming (multiple objectives portfolio). These methods select the set of projects which deliver the maximum benefit (e.g., net present …
-
Project selection and timing integrating project deferral, cash flow transferals, financing and investment functions
… a modified version of Weingartner' s 0-1 integer programming model is developed. By introducing artificial variables, the modified model can be maintained in a linear programming (LP) form (mixed integer). The advantage of the formulation is that, the relatively convenient LP software …
-
Optimization of urban traffic control strategies by a network design model
… strategies. An UTNDP is a typical bi-level programming program, where the lower level problem is a User Equilibrium (UE) traffic assignment problem, while the upper level problem is a 0-1 integer programming problem. The upper level of an UTNDP model is used to represent the choices of the …
-
Modeling and analysis of three-dimensional robotic palletizing systems for mixed carton sizes
… grocery or merchandise distributions;A mixed 0/1 integer programming model has been developed to solve for three-dimensional optimal pallet patterns. Since the pallet packing problem has been classified as NP-hard, a heuristic dynamic programming algorithm has also been developed. Only "good" …
-
Automatic data layout for distributed memory machines
… yet efficient machine-independent parallel programming model. Besides the algorithm selection, the data layout choice is the key intellectual challenge in writing an efficient program in such languages. The performance of a data layout depends on the target compilation system, the target …
-
Intelligent scheduling and control of automated guided vehicle considering machine loading in a flexible manufacturing system: using hopfield networks and simulation.
… is known to be NP-hard. MLP formulated as 0-1 integer programming problems has been solved by the methods of linearizing the nonlinear terms, branch and bound algorithm, and heuristic methods which have also been popularly applied. Hopfield Networks as a class of artificial neural networks have …
-
Μοντέλα διαχείρισης εναέριας κυκλοφορίας: η προσέγγιση της ελεύθερης πτήσης με 4D τροχιές: μελέτη της ενεργειακής απόδοσης των μοντέλων
Air traffic is the sum of flights taking place in the airspace and airport maneuvering area. Air traffic management is guided by flight safety. Air Traffic Management is a relatively new field of research and development. Its creation is inextricably linked to the development of civil aviation. The …
-
On Numerical Methods for Efficient Deep Neural Networks
… the binary masking variables. The resulted 0-1 integer programming problem is approximately solved by sequential quadratic programming. COBLA does not introduce any hyperparameter. We empirically demonstrate that COBLA outperforms prior art using the SqueezeNet and VGG-16 architecture on the …
-
ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ.
Η ΔΙΑΤΡΙΒΗ ΑΥΤΗ ΑΣΧΟΛΕΙΤΑΙ ΜΕ ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΤΩΝ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ ΚΑΙ ΔΙΝΕΤΑΙ ΕΜΦΑΣΗ ΣΕ ΜΕΘΟΔΟΥΣ ΒΕΛΤΙΣΤΗΣ ΕΠΙΛΥΣΗΣ ΤΟΥ ΠΡΟΒΛΗΜΑΤΟΣ. ΤΟ ΠΡΟΒΛΗΜΑ ΔΙΑΤΥΠΩΝΕΤΑΙ ΚΑΙ ΚΑΤΑΣΤΡΩΝΕΤΑΙ ΜΕ ΤΗΝ ΜΟΡΦΗ ΤΩΝ ΠΡΟΒΛΗΜΑΤΩΝ 0 - 1 ΑΚΕΡΑΙΟΥ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΥ. ΤΟ ΠΡΟΒΛΗΜΑ ΕΠΙΛΥΕΤΑΙ ΜΕ ΔΥΟ …