Results 31 to 40 of about 10,477 (184)
The value iteration algorithm is not strongly polynomial for discounted dynamic programming [PDF]
Operations Research Letters, 2014 This note provides a simple example demonstrating that, if exact computations are allowed, the number of iterations required for the value iteration algorithm to find an optimal policy for discounted dynamic programming problems may grow arbitrarily quickly with the size of the problem.
Eugene A. Feinberg, Jefferson Huang
openaire +2 more sources
Strongly polynomial simplex algorithm for bipartite vertex packing
Discrete Applied Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronald D. Armstrong, Zhiying Jin
openaire +2 more sources
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 17 ...
Satoru Iwata 0001 +2 more
openaire +2 more sources
Clinical and Developmental Immunology, 2012 Twenty B candidate epitopes of glycoproteins B (gB2), C (gC2), E (gE2), G (gG2), and I (gI2) of herpes simplex virus type 2 (HSV-2) were predicted using DNAstar, Biosun, and Antheprot methods combined with the polynomial method.
Mingjie Pan +9 more
doaj +1 more source
A strongly polynomial algorithm for the minimum cost tension problem
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Malika Hadjiat, Jean François Maurras
openaire +1 more source
Widest Path in Networks with Gains/Losses
AxiomsIn this paper, the generalized widest path problem (or generalized maximum capacity problem) is studied. This problem is denoted by the GWPP. The classical widest path problem is to find a path from a source (s) to a sink (t) with the highest capacity ...
Javad Tayyebi +2 more
doaj +1 more source
Application of Nontraditional Optimization Techniques for Airfoil Shape Optimization
Modelling and Simulation in Engineering, 2012 The method of optimization algorithms is one of the most important parameters which will strongly influence the fidelity of the solution during an aerodynamic shape optimization problem.
R. Mukesh, K. Lingadurai, U. Selvakumar
doaj +1 more source
Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal
Mathematics, 2019 Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems having ...
Urmila Pyakurel +3 more
doaj +1 more source
Adjusting scheduling model with release and due dates in production planning
Cogent Engineering, 2017 Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in production planning may give certain benefits, we conduct a detailed study of the optimality conditions and dominance relations for a strongly NP-hard single ...
Elisa Chinos, Nodari Vakhania
doaj +1 more source
Exact and Heuristic Algorithms for Thrift Cyclic Scheduling
Algorithms, 2009 Non-preemptive schedulers, despite their many discussed drawbacks, remain a very popular choice for practitioners of real-time and embedded systems. The non-preemptive ‘thrift’ cyclic scheduler—variations of which can be found in other application areas ...
Michael J. Short
doaj +1 more source