Log in

Relevant bibliographies by topics / Fixed-Charge Problems / Journal articles

To see the other types of publications on this topic, follow the link: Fixed-Charge Problems.

Journal articles on the topic 'Fixed-Charge Problems'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Fixed-Charge Problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Lev, Benjamin, and Krzysztof Kowalski. "Modeling fixed-charge problems with polynomials." Omega 39, no. 6 (2011): 725–28. http://dx.doi.org/10.1016/j.omega.2011.02.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Angulo, Gustavo, and Mathieu Van Vyve. "Fixed-charge transportation problems on trees." Operations Research Letters 45, no. 3 (2017): 275–81. http://dx.doi.org/10.1016/j.orl.2017.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Padberg, M. W., T. J. Van Roy, and L. A. Wolsey. "Valid Linear Inequalities for Fixed Charge Problems." Operations Research 33, no. 4 (1985): 842–61. http://dx.doi.org/10.1287/opre.33.4.842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Molla-Alizadeh-Zavardehi, S. "Step Fixed Charge Transportation Problems via Genetic Algorithm." Indian Journal of Science and Technology 7, no. 7 (2014): 949–54. http://dx.doi.org/10.17485/ijst/2014/v7i7.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lamar, Bruce W., and Chris A. Wallace. "Revised-Modified Penalties for Fixed Charge Transportation Problems." Management Science 43, no. 10 (1997): 1431–36. http://dx.doi.org/10.1287/mnsc.43.10.1431.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Haberl, Josef. "Fixed-charge continuous knapsack problems and pseudogreedy solutions." Mathematical Programming 85, no. 3 (1999): 617–42. http://dx.doi.org/10.1007/s101070050074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

ADLAKHA, V., K. KOWALSKI, R. VEMUGANTI, and B. LEV. "More-for-less algorithm for fixed-charge transportation problems." Omega 35, no. 1 (2007): 116–27. http://dx.doi.org/10.1016/j.omega.2006.03.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ghassemi Tari, Farhad, Zhrasadat Hashemi, and Tao Peng. "Three hybrid GAs for discounted fixed charge transportation problems." Cogent Engineering 5, no. 1 (2018): 1463833. http://dx.doi.org/10.1080/23311916.2018.1463833.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hussein Farag, Hanan. "An Approach for Solving the Fixed Charge Transportation Problems." Journal of University of Shanghai for Science and Technology 23, no. 07 (2021): 583–90. http://dx.doi.org/10.51201/jusst/21/07187.

Full text

Abstract:

This paper presents modified Vogel’s method that solves the fixed charge transportation problems, the relaxed transportation problem proposed by Balinski in 1961 to find an approximate solution for the fixed charge transportation problem (FCTP). This approximate solution is considered as a lower limit for the optimal solution of FCTP. This paper developed the modified Vogel’s method to find an approximate solution used as a lower limit for the FCTP. This is better than Balinski’s method in 1961. My approach relies on applying Vogel’s approximation method to the relaxed transportation problem.

APA, Harvard, Vancouver, ISO, and other styles

10

Sandrock, Keith. "A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems." Journal of the Operational Research Society 39, no. 5 (1988): 467. http://dx.doi.org/10.2307/2582361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Diaby, Moustapha. "Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems." Journal of the Operational Research Society 42, no. 11 (1991): 991. http://dx.doi.org/10.2307/2583220.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Stallaert, Jan. "Valid inequalities and separation for capacitated fixed charge flow problems." Discrete Applied Mathematics 98, no. 3 (2000): 265–74. http://dx.doi.org/10.1016/s0166-218x(99)00164-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

M. ALTASSAN, KHALID, MAHMOUD M. EL-SHERBINY, ALY M. RAGAB, and BOKKASAM SASIDHAR. "A Heuristic Approach for Solving the Fixed Charge Transportation Problems." International Review of Management and Business Research 7, no. 2 (2018): 330–37. http://dx.doi.org/10.30543/7-2(2018)-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Adlakha, Veena, and Krzysztof Kowalski. "A simple heuristic for solving small fixed-charge transportation problems." Omega 31, no. 3 (2003): 205–11. http://dx.doi.org/10.1016/s0305-0483(03)00025-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Sandrock, Keith. "A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems." Journal of the Operational Research Society 39, no. 5 (1988): 467–75. http://dx.doi.org/10.1057/jors.1988.80.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Diaby, Moustapha. "Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems." Journal of the Operational Research Society 42, no. 11 (1991): 991–1001. http://dx.doi.org/10.1057/jors.1991.189.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Ragsdale, Cliff T., and Patrick G. McKeown. "An algorithm for solving fixed-charge problems using surrogate constraints." Computers & Operations Research 18, no. 1 (1991): 87–96. http://dx.doi.org/10.1016/0305-0548(91)90045-s.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Rebennack, Steffen, Artyom Nahapetyan, and Panos M. Pardalos. "Bilinear modeling solution approach for fixed charge network flow problems." Optimization Letters 3, no. 3 (2009): 347–55. http://dx.doi.org/10.1007/s11590-009-0114-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Ng, Peh H., and Ronald L. Rardin. "Commodity family extended formulations of uncapacitated fixed charge network flow problems." Networks 30, no. 1 (1997): 57–71. http://dx.doi.org/10.1002/(sici)1097-0037(199708)30:1<57::aid-net7>3.0.co;2-k.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Khang, Do Ba, and Okitsugu Fujiwara. "Approximate solutions of capacitated fixed-charge minimum cost network flow problems." Networks 21, no. 6 (1991): 689–704. http://dx.doi.org/10.1002/net.3230210606.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Lamar, Bruce W., Yosef Sheffi, and Warren B. Powell. "A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems." Operations Research 38, no. 4 (1990): 704–10. http://dx.doi.org/10.1287/opre.38.4.704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Barr, Richard S., Fred Glover, Toby Huskinson, and Gary Kochenberger. "An extreme‐point tabu‐search algorithm for fixed‐charge network problems." Networks 77, no. 2 (2021): 322–40. http://dx.doi.org/10.1002/net.22020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

POP, PETRICA C., and CORINA POP SITAR. "New models of the generalized fixed-charge network design problem." Carpathian Journal of Mathematics 28, no. 1 (2012): 143–50. http://dx.doi.org/10.37193/cjm.2012.01.04.

Full text

Abstract:

We consider in this paper the generalized fixed-charge network design (GFCND) problem in which we are interested to find the cheapest backbone network connecting exactly one hub from each of the given clusters. The GFCND problem belongs to the class of generalized combinatorial optimization problems. We describe two mixed integer programming formulations of the GFCND problem. Based on one of the new proposed formulations, we solve the GFCND problem to optimality using CPLEX for problems with up to 30 clusters and 200 nodes. Computational results are reported and compared with those from the li

APA, Harvard, Vancouver, ISO, and other styles

24

Kannan, G., P. Senthil, P. Sasikumar, and V. P. Vinay. "A Nelder and Mead Methodology for Solving Small Fixed-Charge Transportation Problems." International Journal of Information Systems and Supply Chain Management 1, no. 4 (2008): 60–72. http://dx.doi.org/10.4018/jisscm.2008100104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Mashford, J. S. "A method for the solution of fixed charge problems by Benders' decomposition." Optimization 21, no. 1 (1990): 101–7. http://dx.doi.org/10.1080/02331939008843523.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Nahapetyan, Artyom, and Panos Pardalos. "Adaptive dynamic cost updating procedure for solving fixed charge network flow problems." Computational Optimization and Applications 39, no. 1 (2007): 37–50. http://dx.doi.org/10.1007/s10589-007-9060-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Costa, Alysson M. "A survey on benders decomposition applied to fixed-charge network design problems." Computers & Operations Research 32, no. 6 (2005): 1429–50. http://dx.doi.org/10.1016/j.cor.2003.11.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Ghassemi Tari, Farhad, and Zahrasadat Hashemi. "Prioritized K-mean clustering hybrid GA for discounted fixed charge transportation problems." Computers & Industrial Engineering 126 (December 2018): 63–74. http://dx.doi.org/10.1016/j.cie.2018.09.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Raj, K. Antony Arokia Durai, and Chandrasekharan Rajendran. "A Hybrid Genetic Algorithm for Solving Single-Stage Fixed-Charge Transportation Problems." Technology Operation Management 2, no. 1 (2011): 1–15. http://dx.doi.org/10.1007/s13727-012-0001-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Glover, Fred. "Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks." Journal of Heuristics 11, no. 4 (2005): 307–36. http://dx.doi.org/10.1007/s10732-005-2135-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Atamtürk, Alper, Andrés Gómez, and Simge Küçükyavuz. "Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems." Networks 67, no. 4 (2016): 299–315. http://dx.doi.org/10.1002/net.21677.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sáez Aguado, Jesús. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems." Annals of Operations Research 172, no. 1 (2008): 45–69. http://dx.doi.org/10.1007/s10479-008-0483-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sorokin, Alexey, Vladimir Boginski, Artyom Nahapetyan, and Panos M. Pardalos. "Computational risk management techniques for fixed charge network flow problems with uncertain arc failures." Journal of Combinatorial Optimization 25, no. 1 (2011): 99–122. http://dx.doi.org/10.1007/s10878-011-9422-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Ghosh, Shyamali, Sankar Kumar Roy, Ali Ebrahimnejad, and José Luis Verdegay. "Multi-objective fully intuitionistic fuzzy fixed-charge solid transportation problem." Complex & Intelligent Systems 7, no. 2 (2021): 1009–23. http://dx.doi.org/10.1007/s40747-020-00251-3.

Full text

Abstract:

AbstractDuring past few decades, fuzzy decision is an important attention in the areas of science, engineering, economic system, business, etc. To solve day-to-day problem, researchers use fuzzy data in transportation problem for presenting the uncontrollable factors; and most of multi-objective transportation problems are solved using goal programming. However, when the problem contains interval-valued data, then the obtained solution was provided by goal programming may not satisfy by all decision-makers. In such condition, we consider a fixed-charge solid transportation problem in multi-obj

APA, Harvard, Vancouver, ISO, and other styles

35

Herer, Y. T., M. J. Rosenblatt, and I. Hefter. "Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation." Transportation Science 30, no. 4 (1996): 276–90. http://dx.doi.org/10.1287/trsc.30.4.276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Giri, Pravash Kumar, Manas Kumar Maiti, and Manoranjan Maiti. "Simulation approach to solve fuzzy fixed charge multi-item solid transportation problems under budget constraint." International Journal of Operational Research 32, no. 1 (2018): 56. http://dx.doi.org/10.1504/ijor.2018.091202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Maiti, Manoranjan, Pravash Kumar Giri, and Manas Kumar Maiti. "Simulation approach to solve fuzzy fixed charge multi-item solid transportation problems under budget constraint." International Journal of Operational Research 32, no. 1 (2018): 56. http://dx.doi.org/10.1504/ijor.2018.10012185.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Rardin, Ronald L., and Laurence A. Wolsey. "Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems." European Journal of Operational Research 71, no. 1 (1993): 95–109. http://dx.doi.org/10.1016/0377-2217(93)90263-m.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Saharidis, Georgios K. D., Maria Boile, and Sotiris Theofanis. "Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems." Expert Systems with Applications 38, no. 6 (2011): 6627–36. http://dx.doi.org/10.1016/j.eswa.2010.11.075.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kim, Dukwon, Xinyan Pan, and Panos M. Pardalos. "An Enhanced Dynamic Slope Scaling Procedure with Tabu Scheme for Fixed Charge Network Flow Problems." Computational Economics 27, no. 2-3 (2006): 273–93. http://dx.doi.org/10.1007/s10614-006-9028-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Lotfi, M. M., and R. Tavakkoli-Moghaddam. "A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems." Applied Soft Computing 13, no. 5 (2013): 2711–26. http://dx.doi.org/10.1016/j.asoc.2012.11.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Katayama, Naoto. "MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem." Asia-Pacific Journal of Operational Research 37, no. 03 (2020): 2050009. http://dx.doi.org/10.1142/s0217595920500098.

Full text

Abstract:

The fixed-charge capacitated multicommodity network design problem is a fundamental optimization problem arising in many network configurations. The solution of the problem provides an appropriate network design as well as routes of multicommodity flows aimed at minimizing the total cost, which is the sum of the flow costs and fixed-charge costs over a network with limited arc capacities. In the present paper, we introduce a combined approach with a capacity scaling procedure for finding an initial feasible solution and an MIP neighborhood search for improving the solutions. Besides, we modify

APA, Harvard, Vancouver, ISO, and other styles

43

McKeown, Patrick G., and Cliff T. Racsdale. "A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems." Computers & Operations Research 17, no. 1 (1990): 9–16. http://dx.doi.org/10.1016/0305-0548(90)90023-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Котов and P. Kotov. "CONSTRUCTIVE ASPECTS OF ELECTRODYNAMIC." Modeling of systems and processes 9, no. 1 (2016): 8–10. http://dx.doi.org/10.12737/21617.

Full text

Abstract:

Dynamic models of the accelerated shift of the elementary particle with a charge in the electromagnetic field of measurable intensity are considered and the substantial relations, the distinctive state and solutions of problems in connection with the equations of stable elementary particle movement in a uniform magnetic field of the fixed intensity are offered.

APA, Harvard, Vancouver, ISO, and other styles

45

Madleňák, Radovan, Lucia Madleňáková, Jozef Štefunko, and Reiner Keil. "Multiple Approaches of Solving Allocation Problems on Postal Transportation Network in Conditions of Large Countries." Transport and Telecommunication Journal 17, no. 3 (2016): 222–30. http://dx.doi.org/10.1515/ttj-2016-0020.

Full text

Abstract:

Abstract The article deals with the optimizing the postal transportation network with two different optimizing methods. The research adopted in this article uses allocation models within graph theory to obtain results for addressed optimization problem. The article presents and compares two types of these models: p-median and uncapacitated fixed charge facility location model. The aim of p-median model is to find the location of P facilities in network, serving all demands in a way ensuring the average transport cost to be minimal. Fixed charge location model approach the issue of facility loc

APA, Harvard, Vancouver, ISO, and other styles

46

Glover, Fred, and Hanif D. Sherali. "Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints." Annals of Operations Research 140, no. 1 (2005): 215–33. http://dx.doi.org/10.1007/s10479-005-3972-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Halder (Jana), Sharmistha, Barun Das, Goutam Panigrahi, and Manoranjan Maiti. "Some special fixed charge solid transportation problems of substitute and breakable items in crisp and fuzzy environments." Computers & Industrial Engineering 111 (September 2017): 272–81. http://dx.doi.org/10.1016/j.cie.2017.07.030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Aktar, Md Samim, Manoranjan De, Sanat Kumar Mazumder, and Manoranjan Maiti. "Multi-Objective Green 4-dimensional transportation problems for breakable incompatible items with different fixed charge payment policies." Computers & Industrial Engineering 156 (June 2021): 107184. http://dx.doi.org/10.1016/j.cie.2021.107184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Kazemi, Ahmad, Pierre Le Bodic, Andreas T. Ernst, and Mohan Krishnamoorthy. "New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem." Computers & Operations Research 136 (December 2021): 105505. http://dx.doi.org/10.1016/j.cor.2021.105505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Singh, Sungeeta, Renu Tuli, and Deepali Sarode. "A review on fuzzy and stochastic extensions of the multi index transportation problem." Yugoslav Journal of Operations Research 27, no. 1 (2017): 3–29. http://dx.doi.org/10.2298/yjor150417007s.

Full text

Abstract:

The classical transportation problem (having source and destination as indices) deals with the objective of minimizing a single criterion, i.e. cost of transporting a commodity. Additional indices such as commodities and modes of transport led to the Multi Index transportation problem. An additional fixed cost, independent of the units transported, led to the Multi Index Fixed Charge transportation problem. Criteria other than cost (such as time, profit etc.) led to the Multi Index Bi-criteria transportation problem. The application of fuzzy and stochastic concept in the above transportation p

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!