Mikhail Nediak

Orcid: 0000-0003-3529-6465

According to our database1, Mikhail Nediak authored at least 14 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Selling Passes to Strategic Customers.
Oper. Res., 2020

2014
Quantity Premiums and Discounts in Dynamic Pricing.
Oper. Res., 2014

2012
Cargo Capacity Management with Allotments and Spot Market Demand.
Oper. Res., 2012

2011
Network Cargo Capacity Management.
Oper. Res., 2011

2010
Weak aggregating algorithm for the distribution-free perishable inventory problem.
Oper. Res. Lett., 2010

2009
Dynamic Pricing in the Presence of Strategic Consumers and Oligopolistic Competition.
Manag. Sci., 2009

Dynamic Pricing with Online Learning and Strategic Consumers: An Application of the Aggregating Algorithm.
Oper. Res., 2009

2008
Risk in Revenue Management and Dynamic Pricing.
Oper. Res., 2008

2007
Linear programming with online learning.
Oper. Res. Lett., 2007

Price Guarantees in Dynamic Pricing and Revenue Management.
Oper. Res., 2007

Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming.
J. Heuristics, 2007

2005
Depth-Optimized Convexity Cuts.
Ann. Oper. Res., 2005

2003
Planar case of the maximum box and related problems.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
The Maximum Box Problem and its Application to Data Analysis.
Comput. Optim. Appl., 2002


  Loading...