[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
    • 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
    • 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
    • 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
    • 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/12—Shortest path evaluation
    • 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/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • 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/04—Interdomain routing, e.g. hierarchical routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"

Similar Documents

Publication Publication Date Title
Chitra et al. A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks
Ebrahimnejad An improved approach for solving fuzzy transportation problem with triangular fuzzy numbers
Reis et al. A biased random‐key genetic algorithm for OSPF and DEFT routing to minimize network congestion
Ahmadi-Javid et al. The unequal area facility layout problem with shortest single-loop AGV path: how material handling method matters
Abbaszadeh Sori et al. The fuzzy inference approach to solve multi-objective constrained shortest path problem
Gutjahr On the finite-time dynamics of ant colony optimization
Avni et al. Network-formation games with regular objectives
Nguyen et al. Generalized nash fairness solutions for bi‐objective minimization problems
Sung et al. An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints
Sarwar et al. Bipolar fuzzy circuits with applications
Dunkel et al. On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
Pramanik et al. A multi objective solid transportation problem in fuzzy, bi-fuzzy environment via genetic algorithm
Torkzadeh et al. Multi-constraint QoS routing using a customized lightweight evolutionary strategy
Maniscalco et al. Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing
Ebrahimnejad et al. A novel lexicographic optimization method for solving shortest path problems with interval-valued triangular fuzzy arc weights
Büsing et al. The budgeted minimum cost flow problem with unit upgrading cost
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
Fu et al. An interactive preference-based evolutionary algorithm for multi-criteria satisficing optimization
Chitra et al. A nondominated sorting genetic algorithm for shortest path routing problem
Jamwal et al. A fuzzy based multiobjective optimization of multi echelon supply chain network
Bueno et al. Four-objective formulations of multicast flows via evolutionary algorithms with quality demands
Elizabeth et al. Fuzzy Shortest Path Problem Based on Level λ‐Triangular LR Fuzzy Numbers
Galli Algorithms for integer programming