Abstract
A class of optimization problems over subsets of zero-one vectors of then-dimensional unit cube given by a special linear congruence relation is considered. The general problem is formulated as a zero-one linear program, minimal and complete descriptions of the associated polytopes by linear inequalities are derived and an\(\mathcal{O}(n \log n)\) time algorithm for the optimization problems is given. Since the number of inequalities that completely describe the polytope grows exponentially withn, we also give a separation algorithm that identifies violated inequalities in time\(\mathcal{O}(n^2 )\). A particular variation of the bin packing problem is a special case of our problem and can thus be solved in polynomial time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
