[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Nguyen et al., 2024 - Google Patents

Generalized nash fairness solutions for bi‐objective minimization problems

Nguyen et al., 2024

View PDF
Document ID
11470501069490703802
Author
Nguyen M
Baiou M
Nguyen V
Vo T
Publication year
Publication venue
Networks

External Links

Snippet

In this article, we consider a particular case of bi‐objective optimization (BOO), called bi‐ objective minimization (BOM), where the two objective functions to be minimized take only positive values. As well as for BOO, most of the methods proposed in the literature for …
Continue reading at hal.science (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices

Similar Documents

Publication Publication Date Title
Chitra et al. A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks
Zou et al. Solving multiobjective optimization problems using artificial bee colony algorithm
Ebrahimnejad An improved approach for solving fuzzy transportation problem with triangular fuzzy numbers
Clímaco et al. Multicriteria path and tree problems: discussion on exact algorithms and applications
Ahmadi-Javid et al. The unequal area facility layout problem with shortest single-loop AGV path: how material handling method matters
Dutta et al. A survey on pareto-based eas to solve multi-objective optimization problems
Gutjahr On the finite-time dynamics of ant colony optimization
Gershman et al. A decision tree based recommender system
Ouorou et al. A model for robust capacity planning for telecommunications networks under demand uncertainty
Chaves et al. An adaptive and near parameter-free BRKGA using Q-learning method
Nguyen et al. Generalized nash fairness solutions for bi‐objective minimization problems
Dunkel et al. On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
Sung et al. An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints
Peiró et al. Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem
Behmanesh et al. Modeling and random path-based direct encoding for a closed loop supply chain model with flexible delivery paths
Yuan et al. Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms
Gasparri et al. Fuzzy opinion dynamics
Butt et al. A study of complex dombi fuzzy graph with application in decision making problems
Krumke et al. Minimum cost flows with minimum quantities
Martinelli et al. Genetic approach for optimizing the placement of all-optical regenerators in WSON
Yadav et al. On searching fuzzy shortest path in a network
Cole et al. Bottleneck links, variable demand, and the tragedy of the commons
Huyet et al. Synergy between evolutionary optimization and induction graphs learning for simulated manufacturing systems
Galli Algorithms for integer programming
Fu et al. An interactive preference-based evolutionary algorithm for multi-criteria satisficing optimization