Bard.An algorithm for the mixed-integer nonlinear bilevel programming problem[J].Annals of Operations Research.1992(1)Edmunds T.A., Bard J.F.: An algorithm for the mixed-integer nonlinear bilevel programming problem. Ann. Oper. Res. 34 (1), 149–162 (1992)...
An Algorithm for the Mixed Integer Problem Ralph E. Gomory Introduction by Ralph E. Gomory Later in 1957, as the end of my three-year tour of duty in the Navy was approach- ing, Princeton invited me to return as Higgins Lecturer in Mathematics. I had been ...
R. Gomory. Outline of an algorithm for integer solutions to linear programs. Bul- letin of the American Mathematical Society, 64(5):275-278, 1958.R.E. Gomory (1958), Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society 64, 275{278...
An Improved Algorithm for solving the Economic Lot Size Problem - Davis - 1995 () Citation Context ... The results are presented in next section. solutions relaxing the constraint (4) as in Bomberger, Davis and Chatfield by proposing a load balancing heuristic integrated to the GA as studied...
In this paper, we consider a linear two-stage robust optimization model with a mixed integer recourse problem. Currently, this type of two-stage robust optimization model does not have any exact solution algorithm available. We first present a set of sufficient conditions under which the existence...
A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion In recent years, the distributed permutation flowshop group scheduling problem(DPFGSP) has become an increasingly active research field. This paper de...
Genetic algorithmMixed integer linear programmingVariable neighbourhood searchThe bi-objective double-floor corridor allocation problem (bDFCAP) investigated here explores the effective placement of given departments in a double-floor space to minimise the overall flow cost and the corridor length objectives...
Section 3 presents a natural mixed integer programming formulation for the problem considered in this work. Section 4 explores a large family of valid inequalities, providing partial facetness results. Section 5 presents an exact separation procedure based on linear programming for the family of valid...
This study presents the K-means clustering-based grey wolf optimizer, a new algorithm intended to improve the optimization capabilities of the conventional grey wolf optimizer in order to address the problem of data clustering. The process that groups similar items within a dataset into non-overlappi...
We present a branch-and-bound algorithm for solving the p -median problem. The bounds are obtained by solving the Lagrangian relaxation of the p -median problem using the subgradient optimization method. The proposed algorithm is simple, requires small core storage and computational time, and can...