Skip to main navigation
Skip to search
Skip to main content

King Fahd University of Petroleum & Minerals Home

Help & FAQ

Home
Profiles
Research units
Projects
Research output
Prizes
Student theses

Search by expertise, name or affiliation

DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION

Uthman Baroudi (Inventor)

King Fahd University of Petroleum & Minerals
Interdisciplinary Research Center for Smart Mobility and Logistics
Department of Computer Engineering

Research output: Patent

Overview

Original language	English
Patent number	US10456912
State	Published - 2019

Cite this

APA
Author
BIBTEX
Harvard
Standard
RIS
Vancouver

Baroudi, U. (2019). DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION. (Patent No. US10456912).

Baroudi, Uthman (Inventor). / DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION. Patent No.: US10456912.

@misc{68db795c7e244fc381549d9c0ecc6354,

title = "DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION",

author = "Uthman Baroudi",

year = "2019",

language = "English",

type = "Patent",

note = "US10456912",

}

Baroudi, U, DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION, Patent No. US10456912.

DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION. / Baroudi, Uthman (Inventor).
Patent No.: US10456912.

Research output: Patent

TY - PAT

T1 - DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION

AU - Baroudi, Uthman

PY - 2019

Y1 - 2019

M3 - Patent

M1 - US10456912

ER -

Baroudi U, inventor. DYNAMIC MULTI-OBJECTIVE AUCTION-BASED (DYMO-AUCTION) TASK ALLOCATION. US10456912. 2019.

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2025 King Fahd University of Petroleum & Minerals, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

About web accessibility

Report vulnerability