A Pareto-Metaheuristic for a Bi-Objective Winner Determination Problem in a Combinatorial Reverse Auction

Computers and Operations Research - United Kingdom
doi 10.1016/j.cor.2013.04.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Bidding Algorithms for a Distributed Combinatorial Auction

2007English

A Comparison of Exact Method - Metaheuristic Method in Determination for Vehicle Routing Problem

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2018English

A Simheuristic for Bi-Objective Stochastic Permutation Flow Shop Scheduling Problem

Journal of Project Management
2019English

The Clock-Proxy Auction: A Practical Combinatorial Auction Design

English

A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem

English

An Analysis of a Combinatorial Auction

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
2002English

A Bi-Objective Turning Restriction Design Problem in Urban Road Networks

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2014English

Hierarchical Package Bidding: A Paper & Pencil Combinatorial Auction

Games and Economic Behavior
EconomicsEconometricsFinance
2010English

A Combinatorial Identity for a Problem in Asymptotic Statistics

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy