Zaloguj się

Gotowe bibliografie tematyczne / Integer programming / Artykuły w czasopismach

Artykuły w czasopismach na temat „Integer programming”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Integer programming.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Integer programming”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Wampler, Joe F., i Stephen E. Newman. "Integer Programming". College Mathematics Journal 27, nr 2 (marzec 1996): 95. http://dx.doi.org/10.2307/2687396.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Wampler, Joe F., i Stephen E. Newman. "Integer Programming". College Mathematics Journal 27, nr 2 (marzec 1996): 95–100. http://dx.doi.org/10.1080/07468342.1996.11973758.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Cornu�jols, G�rard, i William R. Pulleyblank. "Integer programming". Mathematical Programming 98, nr 1-3 (1.09.2003): 1–2. http://dx.doi.org/10.1007/s10107-003-0417-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Kara, Imdat, i Halil Ibrahim Karakas. "Integer Programming Formulations For The Frobenius Problem". International Journal of Pure Mathematics 8 (28.12.2021): 60–65. http://dx.doi.org/10.46300/91019.2021.8.8.

Pełny tekst źródła

Streszczenie:

The Frobenius number of a set of relatively prime positive integers α1,α2,…,αn such that α1< α2< …< αn, is the largest integer that can not be written as a nonnegative integer linear combination of the given set. Finding the Frobenius number is known as the Frobenius problem, which is also named as the coin exchange problem or the postage stamp problem. This problem is closely related with the equality constrained integer knapsack problem. It is known that this problem is NP-hard. Extensive research has been conducted for finding the Frobenius number of a given set of positive integers. An exact formula exists for the case n=2 and various formulas have been derived for all special cases of n = 3. Many algorithms have been proposed for n≥4. As far as we are aware, there does not exist any integer programming approach for this problem which is the main motivation of this paper. We present four integer linear programming formulations about the Frobenius number of a given set of positive integers. Our first formulation is used to check if a given positive integer is the Frobenius number of a given set of positive integers. The second formulation aims at finding the Frobenius number directly. The third formulation involves the residue classes with respect to the least member of the given set of positive integers, where a residue table is computed comprising all values modulo that least member, and the Frobenius number is obtained from there. Based on the same approach underlying the third formulation, we propose our fourth formulation which produces the Frobenius number directly. We demonstrate how to use our formulations with several examples. For illustrative purposes, some computa-tional analysis is also presented.

Style APA, Harvard, Vancouver, ISO itp.

5

Freire, Alexandre S., Eduardo Moreno i Juan Pablo Vielma. "An integer linear programming approach for bilinear integer programming". Operations Research Letters 40, nr 2 (marzec 2012): 74–77. http://dx.doi.org/10.1016/j.orl.2011.12.004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

He, Deng Xu, i Liang Dong Qu. "Population Migration Algorithm for Integer Programming and its Application in Cutting Stock Problem". Advanced Materials Research 143-144 (październik 2010): 899–904. http://dx.doi.org/10.4028/www.scientific.net/amr.143-144.899.

Pełny tekst źródła

Streszczenie:

For integer programming, there exist some difficulties and problems for the direct applications of population migration algorithm (PMA) due to the variables belonging to the set of integers. In this paper, a novel PMA is proposed for integer programming which evolves on the set of integer space. Several functions and cutting stock problem simulation results show that the proposed algorithm is significantly superior to other algorithms.

Style APA, Harvard, Vancouver, ISO itp.

7

Gomory, Ralph E. "Early Integer Programming". Operations Research 50, nr 1 (luty 2002): 78–81. http://dx.doi.org/10.1287/opre.50.1.78.17793.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Feautrier, Paul. "Parametric integer programming". RAIRO - Operations Research 22, nr 3 (1988): 243–68. http://dx.doi.org/10.1051/ro/1988220302431.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Lee, Jon, i Adam N. Letchford. "Mixed integer programming". Discrete Optimization 4, nr 1 (marzec 2007): 1–2. http://dx.doi.org/10.1016/j.disopt.2006.10.005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Onn, Shmuel. "Robust integer programming". Operations Research Letters 42, nr 8 (grudzień 2014): 558–60. http://dx.doi.org/10.1016/j.orl.2014.10.002.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Bienstock, Daniel, i William Cook. "Computational integer programming". Mathematical Programming 81, nr 2 (kwiecień 1998): 147–48. http://dx.doi.org/10.1007/bf01581102.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Schaefer, Andrew J. "Inverse integer programming". Optimization Letters 3, nr 4 (16.06.2009): 483–89. http://dx.doi.org/10.1007/s11590-009-0131-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Lageweg, B. J., J. K. Lenstra, A. H. G. RinnooyKan, L. Stougie i A. H. G. Rinnooy Kan. "STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING". Statistica Neerlandica 39, nr 2 (czerwiec 1985): 97–113. http://dx.doi.org/10.1111/j.1467-9574.1985.tb01131.x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Williams, H. P. "Logic applied to integer programming and integer programming applied to logic". European Journal of Operational Research 81, nr 3 (marzec 1995): 605–16. http://dx.doi.org/10.1016/0377-2217(93)e0359-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

De Loera, Jesús A., Raymond Hemmecke, Shmuel Onn i Robert Weismantel. "N-fold integer programming". Discrete Optimization 5, nr 2 (maj 2008): 231–41. http://dx.doi.org/10.1016/j.disopt.2006.06.006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Williams, H. P., i J. N. Hooker. "Integer programming as projection". Discrete Optimization 22 (listopad 2016): 291–311. http://dx.doi.org/10.1016/j.disopt.2016.08.004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Jan, Rong-Hong, i Maw-Sheng Chern. "Nonlinear integer bilevel programming". European Journal of Operational Research 72, nr 3 (luty 1994): 574–87. http://dx.doi.org/10.1016/0377-2217(94)90424-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Dua, Vivek. "Mixed integer polynomial programming". Computers & Chemical Engineering 72 (styczeń 2015): 387–94. http://dx.doi.org/10.1016/j.compchemeng.2014.07.020.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Atamtürk, Alper, i Martin W. P. Savelsbergh. "Integer-Programming Software Systems". Annals of Operations Research 140, nr 1 (listopad 2005): 67–124. http://dx.doi.org/10.1007/s10479-005-3968-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Weintraub P., Andres. "Integer programming in forestry". Annals of Operations Research 149, nr 1 (2.12.2006): 209–16. http://dx.doi.org/10.1007/s10479-006-0105-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Fujiwara, Hiroshi, Hokuto Watari i Hiroaki Yamamoto. "Dynamic Programming for the Subset Sum Problem". Formalized Mathematics 28, nr 1 (1.04.2020): 89–92. http://dx.doi.org/10.2478/forma-2020-0007.

Pełny tekst źródła

Streszczenie:

SummaryThe subset sum problem is a basic problem in the field of theoretical computer science, especially in the complexity theory [3]. The input is a sequence of positive integers and a target positive integer. The task is to determine if there exists a subsequence of the input sequence with sum equal to the target integer. It is known that the problem is NP-hard [2] and can be solved by dynamic programming in pseudo-polynomial time [1]. In this article we formalize the recurrence relation of the dynamic programming.

Style APA, Harvard, Vancouver, ISO itp.

22

Firmansah, Fery, Muhammad Ridlo Yuwono i Fika Aisyah Munif. "Application of integer linear program in optimizing convection sector production results using branch and bound method". International Journal of Applied Mathematics, Sciences, and Technology for National Defense 1, nr 1 (27.01.2023): 13–20. http://dx.doi.org/10.58524/app.sci.def.v1i1.173.

Pełny tekst źródła

Streszczenie:

This study aimed to determine the application of the integer program in optimizing the production of the convection sector. Integer linear programming is a special form of linear programming in which the decision variable solutions are integers. Ayyumnah store as one part of the convection sectors with a home-scale does not have an appropriate strategy to optimize profits with limited materials owned. The method used in this study is an integer program with the branch and bound method. The result of this research is the optimal amount of production of long shirts and tunics at the Ayyumnah Store with maximum profit.

Style APA, Harvard, Vancouver, ISO itp.

23

Klamroth, Kathrin, Jørgen Tind i Sibylle Zust. "Integer Programming Duality in Multiple Objective Programming". Journal of Global Optimization 29, nr 1 (maj 2004): 1–18. http://dx.doi.org/10.1023/b:jogo.0000035000.06101.07.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Marchand, Hugues, Alexander Martin, Robert Weismantel i Laurence Wolsey. "Cutting planes in integer and mixed integer programming". Discrete Applied Mathematics 123, nr 1-3 (listopad 2002): 397–446. http://dx.doi.org/10.1016/s0166-218x(01)00348-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Gazzah, H., i A. K. Khandani. "Optimum non-integer rate allocation using integer programming". Electronics Letters 33, nr 24 (1997): 2034. http://dx.doi.org/10.1049/el:19971417.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Forrest, J. J. H., i J. A. Tomlin. "Branch and bound, integer, and non-integer programming". Annals of Operations Research 149, nr 1 (2.12.2006): 81–87. http://dx.doi.org/10.1007/s10479-006-0112-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Domínguez, Luis F., i Efstratios N. Pistikopoulos. "Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems". Computers & Chemical Engineering 34, nr 12 (grudzień 2010): 2097–106. http://dx.doi.org/10.1016/j.compchemeng.2010.07.032.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Maslikhah, Siti. "METODE PEMECAHAN MASALAH INTEGER PROGRAMMING". At-Taqaddum 7, nr 2 (6.02.2017): 211. http://dx.doi.org/10.21580/at.v7i2.1203.

Pełny tekst źródła

Streszczenie:

<em>Decision variables in the problem solving linear programs are often in the form of fractions. In some cases there are specific desires the solution in the form of an integer (integer). Integer solution is obtained by way of rounding does not warrant being in the area of fisibel. To obtain integer solutions, among others, by the method of Cutting Plane Algorithm or Branch and Bound. The advantages of the method of Cutting Plane Algorithm is quite effectively shorten the matter, while the advantages of the method of Branch and Bound the error level is to have a little but requires quite a long calculation.</em>

Style APA, Harvard, Vancouver, ISO itp.

29

Earnshaw, Stephanie R., i Susan L. Dennett. "Integer/Linear Mathematical Programming Models". PharmacoEconomics 21, nr 12 (2003): 839–51. http://dx.doi.org/10.2165/00019053-200321120-00001.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Lee, D.-H., H.-J. Kim, G. Choi i P. Xirouchakis. "Disassembly scheduling: Integer programming models". Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 218, nr 10 (październik 2004): 1357–72. http://dx.doi.org/10.1243/0954405042323586.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Gavish, Bezalel, Fred Glover i Hasan Pirkul. "Surrogate Constraints in Integer Programming". Journal of Information and Optimization Sciences 12, nr 2 (maj 1991): 219–28. http://dx.doi.org/10.1080/02522667.1991.10699064.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Wilson, J. M. "Crossword Compilation Using Integer Programming". Computer Journal 32, nr 3 (1.03.1989): 273–75. http://dx.doi.org/10.1093/comjnl/32.3.273.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Feng, Zhiguo, i Ka-Fai Cedric Yiu. "Manifold relaxations for integer programming". Journal of Industrial & Management Optimization 10, nr 2 (2014): 557–66. http://dx.doi.org/10.3934/jimo.2014.10.557.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Gupta, Renu, i M. C. Puri. "Bicriteria integer quadratic programming problems". Journal of Interdisciplinary Mathematics 3, nr 2-3 (czerwiec 2000): 133–48. http://dx.doi.org/10.1080/09720502.2000.10700277.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Williams, H. "Integer programming and pricing revisited". IMA Journal of Management Mathematics 8, nr 3 (1.03.1997): 203–13. http://dx.doi.org/10.1093/imaman/8.3.203.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Hoşten, Serkan, i Bernd Sturmfels. "Computing the integer programming gap". Combinatorica 27, nr 3 (maj 2007): 367–82. http://dx.doi.org/10.1007/s00493-007-2057-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Hua, Hao, Ludger Hovestadt, Peng Tang i Biao Li. "Integer programming for urban design". European Journal of Operational Research 274, nr 3 (maj 2019): 1125–37. http://dx.doi.org/10.1016/j.ejor.2018.10.055.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Gomory, Ralph E., i Ellis L. Johnson. "An approach to integer programming". Mathematical Programming 96, nr 2 (1.05.2003): 181. http://dx.doi.org/10.1007/s10107-003-0382-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Schultz, Rüdiger. "Stochastic programming with integer variables". Mathematical Programming 97, nr 1 (lipiec 2003): 285–309. http://dx.doi.org/10.1007/s10107-003-0445-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Röglin, Heiko, i Berthold Vöcking. "Smoothed analysis of integer programming". Mathematical Programming 110, nr 1 (5.01.2007): 21–56. http://dx.doi.org/10.1007/s10107-006-0055-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Zou, Jikai, Shabbir Ahmed i Xu Andy Sun. "Stochastic dual dynamic integer programming". Mathematical Programming 175, nr 1-2 (2.03.2018): 461–502. http://dx.doi.org/10.1007/s10107-018-1249-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Klabjan, Diego. "Subadditive approaches in integer programming". European Journal of Operational Research 183, nr 2 (grudzień 2007): 525–45. http://dx.doi.org/10.1016/j.ejor.2006.10.009.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Sahinidis, Nikolaos V. "Mixed-integer nonlinear programming 2018". Optimization and Engineering 20, nr 2 (24.04.2019): 301–6. http://dx.doi.org/10.1007/s11081-019-09438-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Adams, Warren P., i Hanif D. Sherali. "Mixed-integer bilinear programming problems". Mathematical Programming 59, nr 1-3 (marzec 1993): 279–305. http://dx.doi.org/10.1007/bf01581249.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Allahviranloo, T., Kh Shamsolkotabi, N. A. Kiani i L. Alizadeh. "Fuzzy integer linear programming problems". International Journal of Contemporary Mathematical Sciences 2 (2007): 167–81. http://dx.doi.org/10.12988/ijcms.2007.07010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Vessal, Ahmad. "COURSE SEQUENCING USING INTEGER PROGRAMMING". Journal of Academy of Business and Economics 13, nr 4 (1.10.2013): 97–102. http://dx.doi.org/10.18374/jabe-13-4.10.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Williams, H. P. "The problem with integer programming". IMA Journal of Management Mathematics 22, nr 3 (5.10.2010): 213–30. http://dx.doi.org/10.1093/imaman/dpq014.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Lovász, László. "Integer sequences and semidefinite programming". Publicationes Mathematicae Debrecen 56, nr 3-4 (1.04.2000): 475–79. http://dx.doi.org/10.5486/pmd.2000.2362.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Labbé, Martine, Alfredo Marín i Antonio M. Rodríguez-Chía. "Lexicographical Order in Integer Programming". Vietnam Journal of Mathematics 45, nr 3 (27.07.2016): 459–76. http://dx.doi.org/10.1007/s10013-016-0220-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Raghavan, Prabhakar. "Integer programming in VLSI design". Discrete Applied Mathematics 40, nr 1 (listopad 1992): 29–43. http://dx.doi.org/10.1016/0166-218x(92)90020-b.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!