Este artigo analisa estratĂŠgias de otimização de gas em Ethereum a partir de duas dimensĂľes principais: o custo dos opcodes da EVM e as escolhas de estruturas de dados em Solidity. A tabela de opcodes da EVM e a evolução do gas schedule mostram que operaçþes de armazenamento e acesso externo, como SSTORE, SLOAD, CALL, BALANCE e EXT*, estĂŁo entre as mais caras, especialmente apĂłs EIPs como a 2929, que aumentaram o custo de acessos âfriosâ a contas e slots de storage para refletir melhor seu impacto na execução e na camada de armazenamento. Estudos recentes sobre custos de armazenamento evidenciam que uma escrita em SSTORE pode custar cerca de 22.100 gas para 32 bytes (aprox. 690 gas/byte), enquanto leituras via SLOAD tambĂŠm sĂŁo significativamente caras, motivando pesquisas sobre tĂŠcnicas como SSTORE2 e mecanismos para corrigir âoverchargeâ em leitura/escrita de storage, com ganhos mĂŠdios de atĂŠ 30â32% em fees para certos padrĂľes de uso. Boas prĂĄticas de otimização de gas em Solidity incluem reduzir o nĂşmero de acessos a storage movendo valores frequentemente lidos para variĂĄveis em memĂłria, empacotar variĂĄveis em slots de 32 bytes (storage packing), preferir tipos fixos a dinâmicos quando possĂvel, evitar cĂłpias desnecessĂĄrias de arrays de storage para memĂłria e desenhar estruturas de dados que minimizem gravaçþes em storage. A literatura e guias de otimização indicam que a escolha entre arrays, mappings, structs e padrĂľes de layout impacta diretamente o custo de execução, especialmente em loops que interagem com storage ou estruturas dinâmicas. Concluiâse que a otimização de gas em Ethereum ĂŠ um problema tanto de engenharia de baixo nĂvel, ligado ao custo de opcodes e ao modelo warm/cold de acessos, quanto de design de dados e algoritmos, com implicaçþes econĂ´micas diretas para usuĂĄrios, protocolos DeFi e estratĂŠgias de design de L2s.<br>
Stochastic Bit-Parallel Maximum Clique Solver (1024-bit Virtual Register) We introduce a stochastic bit-parallel solver for the Maximum Clique Problem (MCP) based on a 1024-bit virtual register architecture implemented as 16 contiguous uint64_t words in standard C++17, ensuring full portability across 64-bit platforms (x86-64, ARM, RISC-V). Core operationsâcandidate intersection, population count, and leading-zero detectionâexecute in exactly 16 instructions per 1024-bit operation. The solver integrates three key components: (i) a co-neighborhood heuristic that identifies high-coreness nodes via O(N²) pairwise popcount over 1024-bit adjacency rows; (ii) a stochastic swarm of independent worker threads; and (iii) greedy clique expansion through iterative bitwise intersection. Exact branch-and-bound solvers (MaxCliqueDyn, MCQ) become computationally intractable on dense random graphs such as G(1024, 0.5), where chromatic coloring bounds lose effectiveness and the search tree grows exponentially, requiring hours of computation on commodity hardware. The proposed method operates specifically within this hard regime, achieving 100% recovery of all 28 planted clique vertices in 153 millisecondsâa setting where exact state-of-the-art methods cannot remain competitive regardless of hardware scaling. Experimental validation was performed on a Qualcomm Snapdragon 8 Gen 2 (8-core ARM) and independently reproduced on Linux x86-64 server hardware. The solver requires no cloud infrastructure and no GPU acceleration. STATEMENT OF PRIOR ART AND LICENSE TERMS (PolyForm Noncommercial Framework) 1. Statement of Prior Art This document constitutes a public disclosure of the stochastic bit-parallel Maximum Clique methodology, including its virtual register architecture, heuristic structure, and execution model.The mathematical and algorithmic concepts are released solely to establish Prior Art and prevent third-party patent claims under 35 U.S.C. § 102 and international equivalents. 2. Software License While the conceptual methods are disclosed defensively, all source code, implementations, binaries, and hardware realizations are not in the public domain and are licensed under the PolyForm Noncommercial License 1.0.0. Permitted (Non-Commercial)⢠Academic research and experimentation⢠Peer review and independent verification⢠Educational and non-profit use⢠Non-commercial open-source research implementations Condition: Publications must cite the canonical DOI or primary reference. Prohibited (Commercial)⢠Integration into proprietary software or hardware⢠Deployment in commercial systems, services, or products⢠Use in paid tools, platforms, or consulting workflows⢠Sublicensing or sale of the code or derivatives 3. Commercial Licensing Any commercial use requires explicit written authorization from the author. 4. No Code-Size Threshold (No De Minimis) The PolyForm Noncommercial License imposes no exemptions based on code length, fragment size, or proportion of reuse. Any useâpartial or completeâremains fully subject to the license. 5. Anti-Snippet Laundering and Anti-Circumvention Extraction, paraphrasing, refactoring, translation, or reimplementation of any algorithmic componentâincluding bit-parallel structures, heuristics, or execution logicâshall be considered derivative use.Attempts to evade the license through minimal reuse, language changes, functional replication, or modular embedding do not limit its applicability.This interpretation aligns with international good-faith and anti-abuse principles. 6. Presumption of Derivation Any system exhibiting substantial functional or structural similarity, developed after exposure to this work, shall be presumed derivative.The burden of proof for independent creation rests on the alleged infringing party. 7. Knowledge Contamination Exposure to the code, documentation, or technical description constitutes knowledge contamination.Subsequent implementations by exposed parties are not considered clean-room unless supported by contemporaneous evidence of prior independent development. 8. Waiver of Jury Trial To the fullest extent permitted by law, all parties waive the right to a jury trial in disputes arising from this license or related use. 9. Severability and Survival If any provision is deemed unenforceable, the remaining provisions remain in effect.The following provisions survive termination: license scope, noncommercial restrictions, anti-circumvention, presumption of derivation, knowledge contamination, intellectual property ownership, waiver of jury trial, and remedies. 10. Academic Use and Research Freedom The author expressly encourages academic and scientific use of this work. The following activities are permitted on a non-commercial basis: ⢠Research, benchmarking, and experimental validation⢠Publication of scientific analyses, comparisons, or extensions⢠Use in university courses, laboratories, and academic projects⢠Inclusion in research solver portfolios⢠Independent theoretical or empirical study All academic use must include proper citation to the original work.
The introduction of non-fungible tokens (NFTs) has revolutionised digital ownership and asset management in the quickly changing environment of blockchain technology. NFTs are a kind of token that cannot be exchanged for another token. On the other hand, as the market for NFTs continues to grow, customers are becoming more and more interested in interoperability across various blockchain networks. Cross-chain non-fungible token markets have been developed as a result of this necessity. These marketplaces make it possible for different blockchain ecosystems to engage in transactions and interactions with one another. LayerZero and Chainlink are two technologies that are very significant in addressing the difficulty of interoperability across different chains.
A connected loopless graph is 2-edge-connected if it remains connected after the removal of at most one of its edges. Many combinatorial optimization problems seek, for a given graph with costs on its edges, a spanning subgraph satisfying certain connectivity constraints. The minimum 2-edge-connected spanning subgraph problem (2-ECSSP) is a problem of this type. It can be formulated as an integer linear program that selects edges of minimum total cost satisfying the restriction that every cut of the given graph is covered by at least two of the selected edges. This problem is known to be NP-hard. This thesis develops rounding algorithms for three variants of 2-ECSSP, focusing on rounding half-integral solutions of the corresponding linear relaxation. This family of solutions often yields the largest known integrality ratio for various subproblems of 2-ECSSP. The first problem we investigate is the half-integral 2-ECSSP with unrestricted costs. We develop a novel 5/3-rounding that, to the best of our knowledge, is the first one with a factor better than 2. Moreover, we design a reduction scheme, restricting the problem to 4-edge-connected graphs with maximum degree at most five. Then, we study the matching augmentation problem (MAP), a subproblem of 2-ECSSP in which the edge costs are either 0 or 1 and the zero cost edges define a matching. We survey a better-than-2-approximation, obtained in 2022 by Bamas, Drygala, and Svensson, presenting a comprehensive proof of their result and determining an improved factor. Additionally, we address conjectures posed in their work and present computational experiments to support our findings. Finally, we discuss the 2-edge-connected spanning multisubgraph problem (2-ECSMP), a variation of 2-ECSSP in which multiple copies of the same edge can be selected. We survey a recent work by Boyd et al. on a 4/3-rounding for the half-integral 2-ECSMP and leverage their techniques to prove novel decomposition theorems for 4-regular 4-edge-connected graphs. Finally, we pose two conjectures concerning extensions of the decomposition results, suggesting new research directions.
Existing blockchain system face scalability issues when processing massive amounts of data.These issues primarily arise due to their consensus based block generation methods.Sharding has emerged as a promising on chain solution to enhance the scalability of blockchain.This technology increases throughput by dividing the main network into several sub-networks, called shards, which can process transactions in parallel.However, implementing sharding in blockchain system presents two significant challenges: Cross shard transactions and load imbalance between different shards.Cross shard transaction refers to transactions generated between accounts belonging to different shards.Load imbalance occurs when specifical one shard processes a disproportionately higher transaction load than others.These challenges can lead to increased network delay, confirmation time, latency, and fees due to complicated inter-shard communication, thereby reducing blockchain throughput.To address these challenges, this paper proposes an innovative account relocation scheme.This scheme aims to optimize load balancing in blockchain sharding using a round robin algorithm.To validate the effectiveness of our approach, we utilized a simulator that incorporates real Ethereum data.We then compared the degree of load balancing achieved by our method against existing methods, such as schemes that use no-relocation and random relocation.Our results indicate a significant improvement in load balancing performance compared to previous approaches.
NFTs or non-fungible tokens are unique digital assets with identifiable characteristics. NFTs can take the form of digital art, GIFs, videos, collectibles, video game merchandise, music, and even tweets. Uniqueness of a digital asset encompasses more than just visual properties, but also factors such as item IDs and hash codes. This means that even though the two NFTs are visually indistinguishable, they have different IDs and codes. In the digital space, these elements are an integral part of an asset&s;s identity as they contain important data about the object&s;s history. The popularity of the Non-Fungible Token (NFT) has grown tremendously since 2020, becoming one of the most popular applications in the Fintech field. However there is still lack of platforms which provide all the functionalities regarding NFTs (including minting, buying and selling) at a single place. This research paper introduces an algorithm for creation of NFTs along with ensuring owner verification which can be used for minting the NFTs in an E-commerce website using the MOTOKO language for creation of canisters consisting the owner id for owner verification and the principal id which serves as a unique token id for the NFT.
This paper is concerned with the integer quadratic multidimensional knapsack problem (QMKP) where the objective function is separable. Our objective is to determine which expansion technique of the integer variables is the most appropriate to solve (QMKP) to optimality using the upper bound method proposed by Quadri et al. (2007). To the best of our knowledge the upper bound method previously mentioned is the most effective method in the literature concerning (QMKP). This bound is computed by transforming the initial quadratic problem into a 0-1 equivalent piecewise linear formulation and then by establishing the surrogate problem associated. The linearization method consists in using a direct expansion initially suggested by Glover (1975) of the integer variables and in applying a piecewise interpolation to the separable objective function. As the direct expansion results in an increase of the size of the problem, other expansions techniques may be utilized to reduce the number of 0-1 variables so as to make easier the solution to the linearized problem. We will compare theoretically the use in the upper bound process of the direct expansion (I) employed in Quadri et al. (2007) with two other basic expansions, namely: (II) a direct expansion with additional constraints and (III) a binary expansion. We show that expansion (II) provides a bound which value is equal to the one computed by Quadri et al (2007). Conversely, we provide the proof of the non applicability of expansion (III) in the upper bound method. More specifically, we will show that if (III) is used to rewrite the integer variables into 0-1 variables then a linear interpolation can not be applied to transform (QMKP) into an equivalent 0-1 piecewise linear problem.
In this paper, we consider ZKIPs for promise problems. A promise problem is a pair of predicates (Q; R). A Turning machine T solves the promise problem (Q; R) if, for every x satisfying Q(x), machine T halts and it answers &quot;yes&quot; iff R(x). When :Q(x), we do not care what T does. First, we define &quot;promised BPP&quot; which is a promise problem version of BPP. Then, we prove that a promise problem (Q; R) has a 3-move interactive proof system which is black-box simulation zero knowledge if and only if (Q; R) 2 promised BPP. Next, we show a &quot;4-move&quot; perfect ZKIPs (black-box simulation) for a promise problem of Quadratic Residuosity and that of Blum Numbers under no cryptographic assumption.
Previous article Next article Heuristic Methods for Location-Allocation ProblemsLeon CooperLeon Cooperhttps://doi.org/10.1137/1006005PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Leon Cooper, Location-allocation problems, Operations Res., 11 (1963), 331â343, No. 3 MR0152365 0113.14201 CrossrefISIGoogle Scholar[2] Google Scholar[3] D. H. Lehmer, Teaching combinatorial tricks to a computerProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 179â193, Combinatorial Analysis MR0113289 0096.00504 CrossrefGoogle Scholar[4] J. Heller, Some numerical experiments for an $M\times J$ flow shop and its decision-theoretical aspects, Operations Res., 8 (1960), 178â184, No. 2 MR0111626 0092.27910 CrossrefISIGoogle Scholar[5] J. Moshman, The Application of Sequential Estimation To Computer Simulation and Monte Carlo Procedures, J. Association for Computing Machinery, 5 (1958), 0086.11603 CrossrefISIGoogle Scholar[6] A. Wald, Sequential Analysis, John Wiley and Sons, New York, 1952 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails An elliptical cover problem in drone delivery network design and its solution algorithmsEuropean Journal of Operational Research, Vol. 304, No. 3 | 1 Feb 2023 Cross Ref Two lower-bounding algorithms for the p-center problem in an areaComputational Urban Science, Vol. 2, No. 1 | 24 January 2022 Cross Ref Optimal planar facility location with dense demands along a curveJournal of the Operational Research Society, Vol. 73, No. 8 | 8 May 2021 Cross Ref A continuous location and maintenance routing problem for offshore wind farms: Mathematical models and hybrid methodsComputers & Operations Research, Vol. 144 | 1 Aug 2022 Cross Ref Spatial autocorrelation informed approaches to solving locationâallocation problemsSpatial Statistics, Vol. 50 | 1 Aug 2022 Cross Ref Electric vehicle charging stations emplacement using genetic algorithms and agent-based simulationExpert Systems with Applications, Vol. 197 | 1 Jul 2022 Cross Ref Less is more: simple algorithms for the minimum sum of squares clustering problemIMA Journal of Management Mathematics, Vol. 33, No. 3 | 19 August 2021 Cross Ref Less is more: discrete starting solutions in the planar p-median problemTOP, Vol. 30, No. 1 | 6 April 2021 Cross Ref A two-level off-grid electric distribution problem on the continuous spaceComputers & Operations Research, Vol. 67 | 1 Apr 2022 Cross Ref Continuous Facility Location ProblemsThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref The New Era of Hybridisation and Learning in Heuristic Search DesignThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Less Is More Approach in Heuristic OptimizationThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Formulation Space Search MetaheuristicThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Surface ozone monitoring and policy: A geospatial decision support tool for suitable location of monitoring stations in urban areasEnvironmental Science & Policy, Vol. 126 | 1 Dec 2021 Cross Ref Articulating Spatial Statistics and Spatial Optimization Relationships: Expanding the Relevance of StatisticsStats, Vol. 4, No. 4 | 19 October 2021 Cross Ref Discrete Facility Location in Machine LearningJournal of Applied and Industrial Mathematics, Vol. 15, No. 4 | 10 July 2022 Cross Ref Teaching SpreadsheetâBased Analysis of Multisource Continuous Facility Location ProblemsDecision Sciences Journal of Innovative Education | 9 August 2021 Cross Ref A matheuristic for the stochastic facility location problemJournal of Heuristics, Vol. 27, No. 4 | 26 February 2021 Cross Ref Edge computing server placement with capacitated location allocationJournal of Parallel and Distributed Computing, Vol. 153 | 1 Jul 2021 Cross Ref Evaluation of heuristics for the p-median problem: Scale and spatial demand distributionComputers, Environment and Urban Systems, Vol. 88 | 1 Jul 2021 Cross Ref Self-Configuring (1 + 1)-Evolutionary Algorithm for the Continuous p-Median Problem with Agglomerative MutationAlgorithms, Vol. 14, No. 5 | 22 April 2021 Cross Ref Complex Energy Networks Optimization: Part IâDevelopment and Validation of a Software for Optimal Load AllocationJournal of Engineering for Gas Turbines and Power, Vol. 143, No. 4 | 22 February 2021 Cross Ref Fiber to the Home (FTTH) Automation Planning, Its Impact on Customer Satisfaction & Cost-EffectivenessWireless Personal Communications, Vol. 117, No. 2 | 24 November 2020 Cross Ref Heuristic-Based Location Allocation of Single Frequency Network StationsIEEE Transactions on Broadcasting, Vol. 67, No. 1 | 1 Mar 2021 Cross Ref Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approachAnnals of Operations Research, Vol. 41 | 5 February 2021 Cross Ref Optimized Supply Chain Management of Rice in South Korea: LocationâAllocation Model of Rice ProductionAgronomy, Vol. 11, No. 2 | 31 January 2021 Cross Ref When closest is not always the best: The distributed p-median problemJournal of the Operational Research Society, Vol. 72, No. 1 | 12 December 2019 Cross Ref Particle Swarm Optimization and Grey Wolf Optimizer to Solve Continuous p-Median Location ProblemsMachine Learning and Big Data Analytics Paradigms: Analysis, Applications and Challenges | 15 December 2020 Cross Ref Location and capacity decisions for electric bus charging stations considering waiting timesTransportation Research Part D: Transport and Environment, Vol. 90 | 1 Jan 2021 Cross Ref APPROPRIATE ALLOCATIONS AND LOCATIONS ANALYSIS OF INCINERATION FACILITIES BY MULTI-OBJECTIVE OPTIMIZATION USING VORONOI DIAGRAM AND GENETIC ALGORITHM: A CASE STUDY OF THE NORTHWESTERN BAY AREA IN CHIBA PREFECTURETransactions of the Operations Research Society of Japan, Vol. 64, No. 0 | 1 Jan 2021 Cross Ref Directional approach to gradual cover: the continuous caseComputational Management Science, Vol. 18, No. 1 | 18 October 2020 Cross Ref An Approximation Approach for Fixed-Charge Transportation-p-Facility Location ProblemLogistics and Supply Chain Management | 30 October 2021 Cross Ref Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means ClusteringComputation, Vol. 8, No. 4 | 5 November 2020 Cross Ref K-Means Genetic Algorithms with Greedy Genetic OperatorsMathematical Problems in Engineering, Vol. 2020 | 27 Nov 2020 Cross Ref On the convergence of the Cooperâs algorithmOptimization Letters, Vol. 14, No. 8 | 23 March 2020 Cross Ref The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methodsJournal of Global Optimization, Vol. 78, No. 2 | 6 December 2019 Cross Ref An exact and a heuristic approach for the transportation-p-facility location problemComputational Management Science, Vol. 17, No. 3 | 30 January 2020 Cross Ref Heuristic approaches for solid transportation-p-facility location problemCentral European Journal of Operations Research, Vol. 28, No. 3 | 28 January 2019 Cross Ref A voltage drop limited decentralized electric power distribution networkComputers & Operations Research, Vol. 118 | 1 Jun 2020 Cross Ref ReferencesLocationâbased Marketing | 17 April 2020 Cross Ref An ADMM-based locationâallocation algorithm for nonconvex constrained multi-source Weber problem under gaugeJournal of Global Optimization, Vol. 76, No. 4 | 11 June 2019 Cross Ref The blockwise coordinate descent method for integer programsMathematical Methods of Operations Research, Vol. 91, No. 2 | 15 June 2019 Cross Ref Biologically Inspired Parent Selection in Genetic AlgorithmsAnnals of Operations Research, Vol. 287, No. 1 | 22 July 2019 Cross Ref Accelerated hyperbolic smoothing method for solving the multisource FermatâWeber and k-Median problemsKnowledge-Based Systems, Vol. 191 | 1 Mar 2020 Cross Ref Scaling up an Edge Server Deployment2020 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) | 1 Mar 2020 Cross Ref Classical and Inverse Median Location Problems under Uncertain EnvironmentActa Mathematicae Applicatae Sinica, English Series, Vol. 36, No. 2 | 11 April 2020 Cross Ref 2020 Cross Ref Multi-facility green Weber problemComputers & Operations Research, Vol. 113 | 1 Jan 2020 Cross Ref A Spatial Optimization Approach for Solving a Multi-facility Location Problem with Continuously Distributed DemandInnovations in Urban and Regional Systems | 12 May 2020 Cross Ref Optimizing Field Productivity by Mobile Warehouse Deployment Using Evolutionary Algorithms2019 IEEE Symposium Series on Computational Intelligence (SSCI) | 1 Dec 2019 Cross Ref Hub relay network design for daily driver routesInternational Journal of Production Research, Vol. 57, No. 19 | 12 February 2019 Cross Ref Revised Weighted Fuzzy C-Means and Fortified Weiszfeld Hybrid Method for Uncapacitated Multi-Facility Location ProblemsInternational Journal of Operations Research and Information Systems, Vol. 10, No. 4 | 1 Oct 2019 Cross Ref Solving multiple facilities location problems with separated clustersOperations Research Letters, Vol. 47, No. 5 | 1 Sep 2019 Cross Ref A Benders Decomposition Method for Designing Reliable Supply Chain Networks Accounting for Multimitigation Strategies and Demand LossesTransportation Science, Vol. 53, No. 5 | 1 Sep 2019 Cross Ref Spatial optimization for land acquisition problems: A review of models, solution methods, and GIS supportTransactions in GIS, Vol. 16 | 6 June 2019 Cross Ref Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planningApplied Mathematics and Computation, Vol. 350 | 1 Jun 2019 Cross Ref The location-allocation problem of drone base stationsComputers & Operations Research | 1 Jun 2019 Cross Ref Optimizing the spatial relocation of hospitals to reduce urban traffic congestion: A case study of BeijingTransactions in GIS, Vol. 23, No. 2 | 1 April 2019 Cross Ref The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problemAnnals of Operations Research, Vol. 275, No. 2 | 23 August 2018 Cross Ref A directional approach to gradual coverTOP, Vol. 27, No. 1 | 15 November 2018 Cross Ref The Optimal Solution Set of the Multi-source Weber ProblemBulletin of the Iranian Mathematical Society, Vol. 45, No. 2 | 12 July 2018 Cross Ref Give-And-Take heuristic model to political redistricting problemsSpatial Information Research, Vol. 5 | 2 March 2019 Cross Ref Crowdsourcing planar facility location allocation problemsComputing, Vol. 101, No. 3 | 20 October 2018 Cross Ref The planar multifacility collection depots location problemComputers & Operations Research, Vol. 102 | 1 Feb 2019 Cross Ref Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste managementAnnals of Operations Research, Vol. 273, No. 1-2 | 4 June 2018 Cross Ref Optimization of competitive facility location for chain storesAnnals of Operations Research, Vol. 273, No. 1-2 | 15 July 2017 Cross Ref Optimal solutions for the continuous p -centre problem and related -neighbour and conditional problems: A relaxation-based algorithmJournal of the Operational Research Society, Vol. 70, No. 2 | 19 January 2018 Cross Ref Introduction: The Practice of Spatial AnalysisThe Practice of Spatial Analysis | 29 June 2018 Cross Ref 2019 Cross Ref 2019 Cross Ref 2019 Cross Ref 2019 Cross Ref Understanding the Weber Location ParadigmContributions to Location Analysis | 8 October 2019 Cross Ref Locating Dimensional Facilities in a Continuous SpaceLocation Science | 17 March 2020 Cross Ref An algorithm for generalized constrained multi-source Weber problem with demand substations4OR, Vol. 16, No. 4 | 2 December 2017 Cross Ref The Weber obnoxious facility location model: A Big Arc Small Arc approachComputers & Operations Research, Vol. 98 | 1 Oct 2018 Cross Ref MIP model for efficient dimensioning of real-world FTTH treesTelecommunication Systems, Vol. 68, No. 2 | 27 September 2017 Cross Ref Classifiers Applied to Dimensioning of Splitters in PON DesignJournal of Optical Communications and Networking, Vol. 10, No. 6 | 21 May 2018 Cross Ref Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocksApplied Mathematical Modelling, Vol. 55 | 1 Mar 2018 Cross Ref Considering Diversity in Spatial Decision Support SystemsGeoComputational Analysis and Modeling of Regional Systems | 31 July 2017 Cross Ref Spatial Autocorrelation and the p-Median ProblemMorphisms for Quantitative Spatial Analysis | 8 March 2018 Cross Ref Location Modeling and Covering MetricsLocation Covering Models | 23 December 2018 Cross Ref Vers un merchandising multi-agentsRetailing et localisation | 1 Jan 2018 Cross Ref A distance-limited continuous location-allocation problem for spatial planning of decentralized systemsComputers & Operations Research, Vol. 88 | 1 Dec 2017 Cross Ref A Two-echelon joint continuous-discrete location modelEuropean Journal of Operational Research, Vol. 262, No. 3 | 1 Nov 2017 Cross Ref Incorporating neighborhood reduction for the solution of the planar p-median problemAnnals of Operations Research, Vol. 258, No. 2 | 12 August 2015 Cross Ref The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approachesEuropean Journal of Operational Research, Vol. 263, No. 1 | 1 Nov 2017 Cross Ref The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methodsComputers & Industrial Engineering, Vol. 113 | 1 Nov 2017 Cross Ref Transportation-location problem with unknown number of facilitiesComputers & Industrial Engineering, Vol. 112 | 1 Oct 2017 Cross Ref Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problemTransportation Research Part E: Logistics and Transportation Review, Vol. 106 | 1 Oct 2017 Cross Ref A versatile adaptive aggregation framework for spatially large discrete location-allocation problemsComputers & Industrial Engineering, Vol. 111 | 1 Sep 2017 Cross Ref On Strategies to Fix Degenerate k-means SolutionsJournal of Classification, Vol. 34, No. 2 | 10 June 2017 Cross Ref Speeding up the optimal method of Drezner for the p -centre problem in the planeEuropean Journal of Operational Research, Vol. 257, No. 3 | 1 Mar 2017 Cross Ref 2-Facility manifold location routing problemOptimization Letters, Vol. 11, No. 2 | 26 December 2015 Cross Ref Location Planning and Network DesignComputational Intelligence in Logistics and Supply Chain Management | 28 July 2016 Cross Ref Hybridisation SearchHeuristic Search | 21 February 2017 Cross Ref Bringing infrastructure into pricing in road freight transportation â A measuring concept based on navigation service dataTransportation Research Procedia, Vol. 25 | 1 Jan 2017 Cross Ref A Genetic Algorithm to Solve the Optimum Location Problem for Surveillance SensorsJournal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography, Vol. 34, No. 6 | 31 Dec 2016 Cross Ref Mixed planar and network single-facility location problemsNetworks, Vol. 68, No. 4 | 18 August 2016 Cross Ref Sequential location of two facilities: comparing random to optimal location of the first facilityAnnals of Operations Research, Vol. 246, No. 1-2 | 19 August 2014 Cross Ref New local searches for solving the multi-source Weber problemAnnals of Operations Research, Vol. 246, No. 1-2 | 5 February 2015 Cross Ref An adaptive perturbation-based heuristic: An application to the continuous p-centre problemComputers & Operations Research, Vol. 75 | 1 Nov 2016 Cross Ref Insights into the effect of traffic congestion on distribution network characteristics â a numerical analysis based on navigation service dataInternational Journal of Logistics Research and Applications, Vol. 19, No. 5 | 13 November 2015 Cross Ref Modeling and solving a capacitated stochastic location-allocation problem using sub-sourcesSoft Computing, Vol. 20, No. 6 | 17 March 2015 Cross Ref A minisum location problem with regional demand considering farthest Euclidean distancesOptimization Methods and Software, Vol. 31, No. 3 | 23 December 2015 Cross Ref Hybrid self-adaptive-velocity particle swarm optimisation-Cooper heuristic for the facility location allocation problem in JakartaInternational Journal of Systems Science: Operations & Logistics, Vol. 3, No. 2 | 14 April 2015 Cross Ref Planning the City Logistics Terminal Location by Applying the Green p -Median Model and Type-2 Neurofuzzy NetworkComputational Intelligence and Neuroscience, Vol. 2016 | 1 Jan 2016 Cross Ref Manifold Location Routing Problem with Applications in Network TheoryModels, Algorithms and Technologies for Network Analysis | 21 October 2016 Cross Ref Prepositioning of Relief Items Under Uncertainty: A Classification of Modeling and Solution Approaches for Disaster ManagementLogistics Management | 9 August 2015 Cross Ref StandortmanagementStrategisches und operatives Logistikmanagement: Distribution | 15 October 2015 Cross Ref A locationâallocation problem with concentric circlesIIE Transactions, Vol. 47, No. 12 | 28 April 2015 Cross Ref Solving the planar p-median problem by variable neighborhood and concentric searchesJournal of Global Optimization, Vol. 63, No. 3 | 23 April 2014 Cross Ref A Parallel Algorithm for the Facility Location Problem Applied to Oil and Gas Logistics2015 International Symposium on Computer Architecture and High Performance Computing Workshop (SBAC-PADW) | 1 Oct 2015 Cross Ref A capacitated location-allocation problem with stochastic demands using sub-sources: An empirical studyApplied Soft Computing, Vol. 34 | 1 Sep 2015 Cross Ref A Heuristic for the Multisource Weber Problem with Service Level ConstraintsTransportation Science, Vol. 49, No. 3 | 1 Aug 2015 Cross Ref A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfacesComputational Management Science, Vol. 12, No. 3 | 23 December 2014 Cross Ref A Constructive Method and a Guided Hybrid GRASP for the Capacitated Multi-Source Weber Problem in the Presence of Fixed CostJournal of Algorithms & Computational Technology, Vol. 9, No. 2 | 1 June 2015 Cross Ref Approximation methods for large-scale spatial queueing systemsTransportation Research Part B: Methodological, Vol. 74 | 1 Apr 2015 Cross Ref The continuous p-centre problem: An investigation into variable neighbourhood search with memoryEuropean Journal of Operational Research, Vol. 241, No. 3 | 1 Mar 2015 Cross Ref Applied Soft Computing | 2015 Cross Ref Investigating Metaheuristics Applications for Capacitated Location Allocation Problem on Logistics NetworksChaos Modeling and Control Systems Design | 4 December 2014 Cross Ref Heuristics for a continuous multi-facility location problem with demand regionsComputers & Operations Research | 1 Sep 2014 Cross Ref Serving regional demand in facility locationPapers in Regional Science, Vol. 93, No. 3 | 4 April 2013 Cross Ref A historical perspective on location problemsBSHM Bulletin: Journal of the British Society for the History of Mathematics, Vol. 29, No. 2 | 9 May 2014 Cross Ref New heuristic algorithms for solving the planar p-median problemComputers & Operations Research | 1 May 2014 Cross Ref Modeling Influenza Pandemic and Planning Food DistributionManufacturing & Service Operations Management, Vol. 16, No. 1 | 1 Feb 2014 Cross Ref A new local search for continuous location problemsEuropean Journal of Operational Research, Vol. No. 2 | 1 Jan 2014 Cross Ref Location for a continuous competitive facility location problem under & Operations Research, Vol. 41 | 1 Jan 2014 Cross Ref The planar location problem: a clustering approachAnnals of Operations Research, Vol. No. 1 | 1 June 2013 Cross Ref Location of a distribution for a Methods of Operations Research, Vol. 78, No. 3 | 13 July 2013 Cross Ref search heuristics for the single and multi-commodity capacitated Multi-facility Weber & Operations Research, Vol. No. 12 | 1 Dec 2013 Cross Ref New heuristic methods for the single-source capacitated facility Weber International Journal of Technology, Vol. No. | 28 June 2013 Cross Ref Continuous and problems with a on of the Operational Research Society, Vol. 64, No. 11 | 21 December 2017 Cross Ref A hybrid approach for the capacitated p-median Soft Computing, Vol. No. 9 | 1 Sep 2013 Cross Ref An efficient heuristic algorithm for the capacitated Vol. 11, No. 3 | 16 December Cross Ref Continuous location of an Vol. No. 2 | 13 April Cross Ref Heuristics for the single source capacitated multi-facility Weber problemComputers & Industrial Engineering, Vol. 64, No. 4 | 1 Apr 2013 Cross Ref Models and Algorithms for Hub and for Service Facilities in to and An International Vol. 19, No. 2 | 4 Mar 2013 Cross Ref allocation and planning Vol. No. 2 | 9 September Cross Ref A new heuristic for solving the p-median problem in the & Operations Research, Vol. No. 1 | 1 Jan 2013 Cross Ref solution methods for the capacitated multi-facility Weber Transactions, Vol. 45, No. 1 | 1 Jan 2013 Cross Ref A Heuristic Algorithm for Multi-Source Location Problem with under The and Applied Analysis, Vol. 2013 | 1 Jan 2013 Cross Ref Research on Multi-Facility Weber Problem to | 3 May 2013 Cross Ref Investigating of Hybrid to Solve the Multi-Source Weber Problems and Performance of with Optimization Algorithms in Engineering, and | 1 Jan 2013 Cross Ref starting solutions for the p-median problem in the in Discrete Mathematics, Vol. | 1 Dec Cross Ref An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation and Spatial Vol. 12, No. 3 | 5 July Cross Ref Capacitated Multi-Facility Weber two heuristic & Operations Research, Vol. No. | 1 Jul Cross Ref of and and application in and Vol. No. 2 | 17 March Cross Ref Solving the multi-commodity capacitated multi-facility Weber problem using and a algorithmJournal of the Operational Research Society, Vol. 63, No. 6 | 21 December 2017 Cross Ref Distributed Service Design with and Science, Vol. No. 2 | 1 May Cross Ref A framework of GIS and computing for spatial problems â a case study of Journal of Information Science, Vol. No. 4 | 1 Apr Cross Ref A heuristic algorithm for multiple facilities with regional Optimization and Applications, Vol. No. 3 | 13 January Cross Ref Facility location under demand to a large-scale Planning Vol. No. 1 | 1 Mar Cross Ref Efficient solution methods for the multi-commodity capacitated multi-facility Weber problemComputers & Operations Research, Vol. No. 2 | 1 Feb Cross Ref A algorithm for the planar single-facility location routing problemComputers & Operations Research, Vol. No. 2 | 1 Feb Cross Ref location of two on Journal of Research, Vol. No. 2 | 1 Feb Cross Ref the convergence in the single-source and multi-source Weber Mathematics and Computation, Vol. No. 12 | 1 Feb Cross Ref StandortmanagementStrategisches und operatives Logistikmanagement: Distribution | 25 September Cross Ref A Analysis Method for International Conference on Computational Intelligence and | 1 Dec Cross Ref Solving a continuous local network design problem with a Journal of Operational Research, Vol. No. 3 | 1 Nov Cross Ref Variable neighbourhood search heuristics for the multi-source Weber problemJournal of the Operational Research Society, Vol. No. 10 | 21 December 2017 Cross Ref A GRASP for the capacitated multi-source Weber problemComputers & Operations Research, Vol. No. | 1 Jul Cross Ref Prepositioning in for Journal of Operational Research, Vol. No. 2 | 1 Mar Cross Ref A algorithm for the locationâallocation problem with dense & Operations Research, Vol. No. 2 | 1 Feb Cross Ref Continuous of Location Analysis | 13 January Cross Ref Median Problems in of Location Analysis | 13 January Cross Ref Heuristics for Location of Location Analysis | 13 January Cross Ref An Algorithm for a Capacitated Multi-Facility Weber Problem with Fuzzy International Conference on and | 1 Nov Cross Ref New in location & Operations Research, Vol. No. 10 | 1 Oct Cross Ref The multi-commodity capacitated multi-facility Weber problem: heuristics and Transactions, Vol. No. 11 | 31 Aug Cross Ref Efficient integer for location and routing in Vol. No. 11 | 1 Aug Cross Ref and the spatial and Computer Modelling, Vol. No. 1-2 | 1 Jul Cross Ref Hybrid random algorithm for solving problem of of Computer Applications, Vol. 30, No. 6 | 23 Jun Cross Ref in variable neighborhood Vol. 8, No. 2 | 16 September Cross Ref and heuristic solutions of the chain problem with Journal of Operational Research, Vol. No. 3 | 1 May Cross Ref A generalized Weiszfeld method for the multi-facility location Research Letters, Vol. No. 3 | 1 May Cross Ref based heuristics for the generalized location problemComputers & Industrial Engineering, Vol. No. 4 | 1 May Cross Ref A continuous analysis framework for the solution of locationâallocation problems with dense & Operations Research, Vol. No. 1 | 1 Jan Cross Ref A Weiszfeld algorithm for the solution of an of the generalized location problemComputers & Mathematics with Applications, Vol. No. 1 | 1 Jan Cross Ref Locating a facility using a hybrid optimization Journal of Production Vol. No. 1 | 1 Jan Cross Ref cover location problems: The planar Transactions, Vol. No. 3 | 19 December Cross Ref A locationâallocation heuristic for the capacitated multi-facility Weber problem with Journal of Operational Research, Vol. No. 3 | 1 Nov Cross Ref based optimization approach for network design problemComputers & Industrial Engineering, Vol. 57, No. 1 | 1 Aug Cross Ref The variable Journal of Operational Research, Vol. No. 2 | 1 Jul Cross Ref Discrete heuristics for the capacitated continuous locationâallocation problem with & Operations Research, Vol. 36, No. | 1 Jul Cross Ref Planning for Optical of Optical Communications and Networking, Vol. No. 1 | 1 June Cross Ref based heuristics for the capacitated multi-source Weber problemComputers & Operations Research, Vol. 36, No. 6 | 1 Jun Cross Ref Spatial models for locationâallocation Statistics & Data Analysis, Vol. 53, No. 8 | 1 Jun Cross Ref Solving multi-facility Weber problem by Vol. 31, No. 3 | 1 January Cross Ref The multi-facility locationâallocation problem with polyhedral & Operations Research, Vol. 36, No. 5 | 1 May Cross Ref of to of the Operational Research Society, Vol. No. | 21 December 2017 Cross Ref and of distribution on a of Operations Research, Vol. No. 1 | 14 June Cross Ref Distribution Network for