Convexity and global optimization: A theoretical link

DOI10.1016/S0304-3975(00)00241-3zbMath0976.68019OpenAlexW2041399190MaRDI QIDQ5941512

Alain Quilliot

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00241-3

zbMATH Keywords

global optimizationMarkov chainsconvexity

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Total dual integrality and integer polyhedra
• Converting Linear Programs to Network Problems
• Tabu Search—Part I
• Tabu Search—Part II
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convexity and global optimization: A theoretical link