The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 363 of The Journal of the Operational Research Society Vol. 54, Issue 4
[page]
2003
The Journal of the Operational Research Society
Preserved Fulltext
For computing an optimal solution to the (integer) linear
programs these systems use a mixed integer programming solver such as, for example, CPLEX’ or XA.* In this work, we have used MPL together with ...
This technique consists in adding structure to a program in the form of auxiliary constraints and auxiliary integer variables, to allow branch- ing on groups of original integer variables. ...
A property of assignment type mixed integer linear programming problems
1983
Operations Research Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Moreover the type of proof can be exploited for related problems to investigate whether a linear programming relaxation will yield mainly integer assignments. ...
integer linear assignment problems. ...
Hence, for these large mixed integer problems with often over 50.000 zero-one variables it was possible to avoid the time consuming mixed integer procedures by using standard linear. programming. ...
doi:10.1016/0167-6377(83)90035-4
fatcat:kezinzkzvjarfidz3yfj6inwha
Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming
2008
International Journal of Bioinformatics Research and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that with this formulation and by using some state-of-the-art integer programming techniques, we can actually solve double digestion problems for fairly large sizes. ...
In this paper, we formulate the double digestion problem as a mixed-integer linear program by following Waterman 1995 in a sightly different form. ...
An integer program with this many binary variables is often considered too large to be solvable even on powerful computers. ...
doi:10.1504/ijbra.2008.021173
pmid:19008180
fatcat:yavfudk5endq5kppwdyxktw6eu
Page 461 of The Journal of Industrial Engineering Vol. 18, Issue 8
[page]
1967
The Journal of Industrial Engineering
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
requirement is added that some of the variables are restricted to integers. ...
x; < 700d, x2 < 400d, x3 < 1000d;
with d,, dz, and d; constrained to values of zero or one. ...
Page 329 of Mathematical Reviews Vol. 56, Issue 1
[page]
1978
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The author describes an algorithm for an all-integer ILP with
x, c, A integers that is designed to increase the determinant of the
optimal basis of the LP relaxation using the cutting plane method. ...
This result is quite analogous to results on the “master problem” for the author’s earlier mixed-integer group problem (“On the group problem for mixed integer program- ming”, IBM Res. Rep. ...
Mathematical model for production sequencing in a manufacturing company
2019
Journal of Physics, Conference Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A mathematical model of integer linear programming was designed, coded and solved by means of the JuliaPro software. ...
The objective of the research was to determine the optimal sequence of production of n jobs in m operations, in a small footwear manufacturing company with characteristics of a flow shop machine environment ...
integer linear programming model, which optimizes the time of completion of jobs (makespan) with a value of 3,807 minutes. ...
doi:10.1088/1742-6596/1388/1/012001
fatcat:ow7dq3annvhchm5juj333hfwhi
Maximisation of Expected Target Damage Value
2005
Defence Science Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The weabon assignment problem has been modelled as a nonlinear integer programming problem'. The problem is to assign weapons to the targets to maximise the optimum-target damage value. ...
to solve t h e problem of weapon assignment to target to maximise the optimum target damage value, because firstly, the results violate the constraints, and secondly, instead of using the integer programming ...
If these are not integers, then these are modified to satisfy the integer restrictions usink Eqn (4) . Let Q be the element with least function valve f(Q). ...
doi:10.14429/dsj.55.1977
fatcat:36oelm76zveblgzdky5fnhp4iq
A unified approach for price directive decomposition procedures in integer programming
1988
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper shows how to generalize the Dantzig-Wolfe decomposition principle to integer programming. ...
The sublevels then respond with their optimal activities given this price function. Finite convergence of the procedure is established. ...
However, the decomposition may be built on one of the two basic solution methods in integer programming: 'branch and bound' or 'cutting plane'. ...
doi:10.1016/0166-218x(88)90077-7
fatcat:kqlue6tsgzh7jfx7fjr4rwguja
Page 256 of Mathematical Reviews Vol. 27, Issue 1
[page]
1964
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A “game with restricted domains of activities’ is defined and conditions are determined for which equilibrium points for this game exist. ...
A more de-
tailed account has appeared elsewhere [the authors,
“Integer Quadratic Programming”, Recent Advances in
Math. Programming, pp. 303-308, McGraw-Hill, New
York, 1963}. ...
A turning restriction design problem in urban road networks
2010
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of intersections where turning restrictions should be implemented. ...
In this paper, a bi-level programming model is proposed to formulate the TRDP. ...
This work is jointly supported by the National Basic Research Program of China ...
doi:10.1016/j.ejor.2010.03.013
fatcat:bzv75kkmurfxliibhfmlsg5jdu
Collection network design with capacity planning in reverse logistics: static and restricted-dynamic models
2018
Figshare
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Two heuristics are proposed for each of the two problems after formulating them as integer programming models. ...
Computational experiments were conducted on various test instances, and the results are reported. ...
a IP: Integer Programming, MILP: Mixed Integer Linear Programming, MINLP: Mixed Integer Nonlinear Programming, SMILP: Stochastic Mixed Integer Linear Programming, MIGP: Mixed Integer Goal Programming b ...
doi:10.6084/m9.figshare.7209620
fatcat:4v6polo6svampjfyqp4lhvabji
Combinatorial optimization: Current successes and directions for the future
2000
Journal of Computational and Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
With the information-technology revolution taking place currently, we now have the opportunity to have our tools embedded into supply-chain systems that determine production and distribution schedules, ...
Now, we can solve much larger problems on personal computers, much of the necessary data is routinely collected and tools exist to speed up both the modeling and the post-optimality analysis. ...
If the linear program is unbounded or infeasible, so is the integer program. If the solution to the linear program is integer, then one has solved the integer program. ...
doi:10.1016/s0377-0427(00)00430-1
fatcat:wn5662mjbvemfco4iepj2m2ddy
Page 459 of The Journal of Business Vol. 43, Issue 4
[page]
1970
The Journal of Business
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This con- straint, together with the restriction of y, to the integer value of either zero or one, forces y,; to equal one whenever xi > 0, that is, whenever the total level of activity exceeds 100. ...
This discrete break in the revenue function can only be represented by the addition of an integer-restricted variable. ...
An algorithm for programming function generators
1981
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The present paper deals with a mathematical problem, encountered when "driving" a fully programmable p-processor controlled function generator. ...
An algorithm is presented to approximate a desired function by a set of straight segments in such a way that additional restrictions (hardware imposed) are also satisfied. ...
latter restriction forbids any ramping function with slope > 1. ...
doi:10.1016/0898-1221(81)90002-x
fatcat:dgznkkzywbazdj7jp52ssbtnzm
A restricted dynamic model for refuse collection network design in reverse logistics
2013
Computers & industrial engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The problem is formulated as an integer programming model for the objective of minimizing the sum of fixed costs to open collection points and variable costs to transport refuses between demand and collection ...
Computational experiments were done on various test instances, and the results are reported. ...
In the next section, the problem is described in more detail with an integer programming model and the assumptions required. ...
doi:10.1016/j.cie.2013.08.001
fatcat:5q7g74toyzcwbhdcbc3jc5apli
« Previous
Showing results 1 — 15 out of 245,124 results