0000000000160963

AUTHOR

Eulalia Martínez

0000-0003-2869-4334

showing 4 related works from this author

A Side-by-Side Single Sex Age-Structured Human Population Dynamic Model: Exact Solution and Model Validation

2008

A side-by-side single sex age-structured population dynamic model is presented in this paper. The model consists of two coupled von Foerster-McKendrick-type quasi-linear partial differential equations, two initial conditions, and two boundary conditions. The state variables of the model are male and female population densities. The solutions of these partial differential equations provide explicit time and age dependence of the variables. The initial conditions define the male and female population densities at the initial time, while the boundary conditions compute the male and female births at zero-age by using fertility rates. The assumptions of the nontime-dependence of the death and fe…

education.field_of_studyState variableAlgebra and Number TheoryPartial differential equationSociology and Political ScienceTotal fertility ratePopulationExact solutions in general relativityFactorizationEconometricsQuantitative Biology::Populations and EvolutionApplied mathematicsBoundary value problemMathematical structureeducationSocial Sciences (miscellaneous)MathematicsThe Journal of Mathematical Sociology
researchProduct

The Rural Postman Problem on mixed graphs with turn penalties

2002

In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…

Mathematical optimizationTraverseGeneral Computer SciencePolynomial transformationTotal costMixed graphManagement Science and Operations ResearchTravelling salesman problemModeling and SimulationComputer Science::Data Structures and AlgorithmsHeuristicsArc routingMetaheuristicMathematicsComputers & Operations Research
researchProduct

Localization and separation of solutions for Fredholm integral equations

2020

[EN] In this paper, we establish a qualitative study of nonlinear Fredholm integral equations, where we will carry out a study on the localization and separation of solutions. Moreover, we consider an efficient algorithm to approximate a solution. To do this, we study the semilocal convergence of an efficient third order iterative scheme for solving nonlinear Fredholm integral equations under mild conditions. The novelty of our work lies in the fact that this study involves first order Frechet derivative and mild conditions. A numerical example involving nonlinear Fredholm integral equations, is solved to show the domains of existence and uniqueness of solutions. The applicability of the it…

Domain of existence of solutionApplied MathematicsFredholm integral equation010102 general mathematicsSeparation (statistics)Mathematical analysisFredholm integral equationTwo-steps Newton iterative schemeLipschitz continuity01 natural sciencesIntegral equation010101 applied mathematicssymbols.namesakesymbols0101 mathematicsDomain of uniqueness of solutionLipschitz conditionMATEMATICA APLICADAAnalysisMathematics
researchProduct

The mixed capacitated general routing problem with turn penalties

2011

In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, such as mail delivery, waste collection and street maintenance operations. Through a polynomial transformation of the considered problem into a Generalized Vehicle routing problem, we suggest a new approach for solving this new problem by transforming it into an Asymmetric Capacitated Vehicle routing problem. In this way, we can solve the new problem both optimally and heuristically using existing algorithms. A powerfu…

Capacitated vehicle routing problemMathematical optimizationRouting problemsPolynomial transformationReal-life applicationsTurn penaltiesCapacitated general routing problemRouting algorithmsVehicle Routing ProblemsTransformationPolynomial transformationsArtificial IntelligenceVehicle routing problemDestination-Sequenced Distance Vector routingGeneral routing problemMathematicsta113Average deviationStatic routingWaste collectionNode (networking)General EngineeringSolution methodsMaintenance operationsVehicle routingComputer Science ApplicationsMemetic algorithmsBenchmark (computing)Network routingMemetic algorithmRouting (electronic design automation)MATEMATICA APLICADAAlgorithmsExpert Systems with Applications
researchProduct