scientific article; zbMATH DE number 1882349

zbMATH Open1075.90509MaRDI QIDQ4797461FDOQ4797461

Authors: A. V. Panyukov 

Publication date: 16 March 2003

Full work available at URL: http://math.nsc.ru/publishing/DAOR/daor.html

Title of this publication is not available (Why is that?)

Recommendations

• Computation of lower bounds on the network cost in location problems subject to distance constraints
• scientific article; zbMATH DE number 1985666
• scientific article; zbMATH DE number 3854768
• Location of connection facilities.
• scientific article; zbMATH DE number 3856820

zbMATH Keywords

allocation problemplacement algorithmpartitioning proceduremixed variables programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Existence theories for problems in abstract spaces (49J27)

Cited In (9)

• Optimization of location of interconnected facilities on parallel lines with forbidden zones
• Computation of lower bounds on the network cost in location problems subject to distance constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps
• Nonatomic problems of positioning lengthy objects
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797461)