GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (227)
Document type
  • Articles  (227)
Source
Publisher
Years
Journal
Topic
  • 1
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2018-03-05
    Description: In this paper we analyze an inter-temporal optimization problem of a representative firm that invests in horizontal and vertical innovations and that faces a constraint with respect to total R&D spending. We find that there can exist two different steady-states of the economy when the amount of research spending falls short of an endogenously determined threshold: one with higher productivities and less new technologies being developed, and the other with more technologies being created and lower productivities. But, for a higher amount of R&D spending the steady-state becomes unique and the firm produces the whole spectrum of available technologies. Thus, a lock-in effect may arise that, however, can be overcome by raising R&D spending sufficiently.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    facet.materialart.
    Unknown
    Springer
    In: 4OR
    Publication Date: 2018-03-05
    Description: In the context of recreational routing, the problem of finding a route which starts and ends in the same location (while achieving a length between specified upper and lower boundaries) is a common task, especially for tourists or cyclists who want to exercise. The topic of finding a tour between a specified starting and ending location while minimizing one or multiple criteria is well covered in literature. In contrast to this, the route planning task in which a pleasant tour with length between a maximum and a minimum boundary needs to be found is relatively underexplored. In this paper, we provide a formal definition of this problem, taking into account the existing literature on which route attributes influence cyclists in their route choice. We show that the resulting problem is NP-hard and devise a branch-and-bound algorithm that is able to provide a bound on the quality of the best solution in pseudo-polynomial time. Furthermore, we also create an efficient heuristic to tackle the problem and we compare the quality of the solutions that are generated by the heuristic with the bounds provided by the branch-and-bound algorithm. Also, we thoroughly discuss the complexity and running time of the heuristic.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    facet.materialart.
    Unknown
    Springer
    In: 4OR
    Publication Date: 2018-03-05
    Description: Fritz John and Karush–Kuhn–Tucker necessary conditions for local LU-optimal solutions of the constrained interval-valued optimization problems involving inequality, equality and set constraints in Banach spaces in terms of convexificators are established. Under suitable assumptions on the generalized convexity of objective and constraint functions, sufficient conditions for LU-optimal solutions are given. The dual problems of Mond–Weir and Wolfe types are studied together with weak and strong duality theorems for them.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2018-03-05
    Description: This paper investigates the coordination problem of a supply chain (SC) composed of a manufacturer exhibiting corporate social responsibility (CSR) and a retailer faced with random demand. The random demand is made up of the multiplication of price-dependent demand and random demand factor (RDF), plus the CSR-dependent demand. The centralized decision problem of the SC is an extension of the existing price setting newsvendor problem (PSNP). It is found that the sufficient condition for the quasi-concavity of expected profit (EP) on PSNP can not ensure the quasi-concavity of EP of the SC. Then, the concavity condition of EP related to the CSR effect factor is presented in the case of uniformly distributed RDF and linear demand in price, and the concavity of EP is proven under centralized decision. For decentralized decision under manufacturer’s Stackelberg game, the manufacturer determines wholesale price and its CSR investment, and then the retailer decides the order quantity and the retail price. The standard revenue-sharing (RS) contract is found not able to coordinate the SC, so a modified RS (MRS) contract is proposed to coordinate the SC. Finally, numerical examples illustrate the validity of the theoretical analysis and the coordination effectiveness of the MRS contract via Matlab.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2018-03-05
    Description: In this paper, we consider a multi-source Weber problem of m new facilities with respect to n demand regions in order to minimize the sum of the transportation costs between these facilities and the demand regions. We find a point on the border of each demand region from which the facilities serve the demand regions at these points. We present an algorithm including a location phase and an allocation phase in each iteration for solving this problem. An algorithm is also proposed for carrying out the location phase. Moreover, global convergence of the new algorithm is proved under mild assumptions, and some numerical results are presented.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    facet.materialart.
    Unknown
    Springer
    In: 4OR
    Publication Date: 2018-03-05
    Description: This is the traditional triennial note used by the editors to give the readers of 4OR information on the state of the journal and its future. In the 3 years that have passed since the last editorial note (Liberti et al. in Q J Oper 13:1–13, 2015 ), three volumes (each containing four issues) of the journal have been published: vol. 13 (2015), vol. 14 (2016), and vol. 15 (2017).
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    facet.materialart.
    Unknown
    Springer
    In: 4OR
    Publication Date: 2018-03-05
    Description: In this paper, we study a vector scheduling problem with rejection on a single machine, in which each job is characterized by a d -dimension vector and a penalty, in the sense that, jobs can be either rejected by paying a certain penalty or assigned to the machine. The objective is to minimize the sum of the maximum load over all dimensions of the total vector of all accepted jobs, and the total penalty of rejected jobs. We prove that the problem is NP-hard and design two approximation algorithms running in polynomial time. When d is a fixed constant, we present a fully polynomial time approximation scheme.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...