No abstract available.
Cited By
- Li W (2024). Optimizing with Attractor: A Tutorial, ACM Computing Surveys, 56:9, (1-41), Online publication date: 31-Oct-2024.
- Abdi A, Cornuéjols G, Guenin B and Tunçel L (2024). Total dual dyadicness and dyadic generating sets, Mathematical Programming: Series A and B, 206:1-2, (125-143), Online publication date: 1-Jul-2024.
- Hu H, Li X, Im H and Wolkowicz H (2024). A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem, Mathematics of Operations Research, 49:2, (729-751), Online publication date: 1-May-2024.
- Gabow H (2023). A Weight-Scaling Algorithm for f-Factors of Multigraphs, Algorithmica, 85:10, (3214-3289), Online publication date: 1-Oct-2023.
- Croella A, Dal Sasso V, Lamorgese L, Mannino C and Ventura P (2022). Disruption Management in Railway Systems by Safe Place Assignment, Transportation Science, 56:4, (938-952), Online publication date: 1-Jul-2022.
- Abdi A, Cornuéjols G, Guenin B and Tunçel L Total Dual Dyadicness and Dyadic Generating Sets Integer Programming and Combinatorial Optimization, (1-14)
- Faenza Y, Oriolo G and Stauffer G (2021). Separation routine and extended formulations for the stable set problem in claw-free graphs, Mathematical Programming: Series A and B, 188:1, (53-84), Online publication date: 1-Jul-2021.
- Koh Z and Sanità L (2020). Stabilizing Weighted Graphs, Mathematics of Operations Research, 45:4, (1318-1341), Online publication date: 1-Nov-2020.
- Rivera Letelier O, Espinoza D, Goycoolea M, Moreno E and Muñoz G (2020). Production Scheduling for Strategic Open Pit Mine Planning, Operations Research, 68:5, (1425-1444), Online publication date: 1-Sep-2020.
- Modaresi S, Sauré D and Vielma J (2020). Learning in Combinatorial Optimization, Operations Research, 68:5, (1585-1604), Online publication date: 1-Sep-2020.
- Snir S Greedy Partition Distance Under Stochastic Models - Analytic Results Bioinformatics Research and Applications, (257-269)
- Friggstad Z, Golestanian A, Khodamoradi K, Martin C, Rahgoshay M, Rezapour M, Salavatipour M and Zhang Y (2019). Scheduling problems over a network of machines, Journal of Scheduling, 22:2, (239-253), Online publication date: 1-Apr-2019.
- Ahmadian S, Hosseinzadeh H and Sanità L (2018). Stabilizing network bargaining games by blocking players, Mathematical Programming: Series A and B, 172:1-2, (249-275), Online publication date: 1-Nov-2018.
- Hanawa Y, Higashikawa Y, Kamiyama N, Katoh N and Takizawa A (2018). The mixed evacuation problem, Journal of Combinatorial Optimization, 36:4, (1299-1314), Online publication date: 1-Nov-2018.
- Gabow H (2018). Data Structures for Weighted Matching and Extensions to b-matching and f-factors, ACM Transactions on Algorithms, 14:3, (1-80), Online publication date: 16-Jul-2018.
- Sheibani K (2018). A Very Fast Heuristic for Combinatorial Optimization With Specific Application to Priority Rule Sequencing in Operations Management, International Journal of Operations Research and Information Systems, 9:3, (77-89), Online publication date: 1-Jul-2018.
- Ayala D, Wolfson O, Dasgupta B, Lin J and Xu B (2018). Spatio-Temporal Matching for Urban Transportation Applications, ACM Transactions on Spatial Algorithms and Systems, 3:4, (1-39), Online publication date: 8-May-2018.
- González O, Segura C, Peña S and León C A memetic algorithm for the Capacitated Vehicle Routing Problem with Time Windows 2017 IEEE Congress on Evolutionary Computation (CEC), (2582-2589)
- Sheibani K (2017). An Incorporation of the Fuzzy Greedy Search Heuristic With Evolutionary Approaches for Combinatorial Optimization in Operations Management, International Journal of Applied Evolutionary Computation, 8:2, (58-72), Online publication date: 1-Apr-2017.
- Park Y and Klabjan D (2017). Bayesian network learning via topological order, The Journal of Machine Learning Research, 18:1, (3451-3482), Online publication date: 1-Jan-2017.
- Chaabane N, Briand C, Huguet M and Agnetis A (2017). Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game, Networks, 69:1, (94-109), Online publication date: 1-Jan-2017.
- Amanatidis G, Birmpas G and Markakis E Coverage, Matching, and Beyond Proceedings of the 12th International Conference on Web and Internet Economics - Volume 10123, (414-428)
- Hota A, Clements A, Sundaram S and Bagchi S Optimal and Game-Theoretic Deployment of Security Investments in Interdependent Assets 7th International Conference on Decision and Game Theory for Security - Volume 9996, (101-113)
- Tolomei P and Torres L (2016). Generalized minor inequalities for the set covering polyhedron related to circulant matrices, Discrete Applied Mathematics, 210:C, (214-222), Online publication date: 10-Sep-2016.
- Swamy C (2016). Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications, ACM Transactions on Algorithms, 12:4, (1-22), Online publication date: 2-Sep-2016.
- Chitnis R, Kamma L and Krauthgamer R Tight Bounds for Gomory-Hu-like Cut Counting Revised Selected Papers of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9941, (133-144)
- Beyer S, Chimani M, Hedtke I and Kotrbčík M A Practical Method for the Minimum Genus of a Graph Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685, (75-88)
- Fekete S, Haas A, Hemmer M, Hoffmann M, Kostitsyna I, Krupke D, Maurer F, Mitchell J, Schmidt A, Schmidt C and Troegel J Computing Nonsimple Polygons of Minimum Perimeter Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685, (134-149)
- Jaderyan M and Khotanlou H (2016). Virulence Optimization Algorithm, Applied Soft Computing, 43:C, (596-618), Online publication date: 1-Jun-2016.
- Ahmadian S, Hosseinzadeh H and Sanití L Stabilizing Network Bargaining Games by Blocking Players Proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization - Volume 9682, (164-177)
- Myklebust T, Sharpe M and Tunçel L (2016). Efficient heuristic algorithms for maximum utility product pricing problems, Computers and Operations Research, 69:C, (25-39), Online publication date: 1-May-2016.
- Gørtz I, Molinaro M, Nagarajan V and Ravi R (2016). Capacitated Vehicle Routing with Nonuniform Speeds, Mathematics of Operations Research, 41:1, (318-331), Online publication date: 1-Feb-2016.
- Straszak D and Vishnoi N Natural algorithms for flow problems Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (1868-1883)
- Byrd G (2015). Cycling through Cyberspace, Computer, 48:8, (72-75), Online publication date: 1-Aug-2015.
- Halappanavar M, Pothen A, Azad A, Manne F, Langguth J and Khan A (2015). Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures, Computer, 48:8, (46-55), Online publication date: 1-Aug-2015.
- Ortiz-Astorquiza C, Contreras I and Laporte G (2015). The Minimum Flow Cost Hamiltonian Cycle Problem, Discrete Applied Mathematics, 187:C, (140-154), Online publication date: 31-May-2015.
- Löhne A and Rudloff B (2015). On the dual of the solvency cone, Discrete Applied Mathematics, 186:C, (176-185), Online publication date: 11-May-2015.
- Yuan Y, Wang G, Chen L and Wang H (2015). Graph similarity search on large uncertain graph databases, The VLDB Journal — The International Journal on Very Large Data Bases, 24:2, (271-296), Online publication date: 1-Apr-2015.
- Calinescu G (2015). Bounding the payment of approximate truthful mechanisms, Theoretical Computer Science, 562:C, (419-435), Online publication date: 11-Jan-2015.
- Droschinsky A, Heinemann B, Kriege N and Mutzel P Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay Algorithms and Computation, (81-93)
- Wolfson O and Lin J A marketplace for spatio-temporal resources and truthfulness of its users Proceedings of the 7th ACM SIGSPATIAL International Workshop on Computational Transportation Science, (70-75)
- Gao Z (2013). An LP-based 3 2 -approximation algorithm for the s - t path graph Traveling Salesman Problem, Operations Research Letters, 41:6, (615-617), Online publication date: 1-Nov-2013.
- Fanghänel D (2013). A bilevel programming problem with maximization of a supermodular function in the lower level, Journal of Combinatorial Optimization, 26:3, (568-584), Online publication date: 1-Oct-2013.
- Goyal N, Olver N and Shepherd F (2013). The VPN Conjecture Is True, Journal of the ACM, 60:3, (1-17), Online publication date: 1-Jun-2013.
- Ayala D, Wolfson O, Xu B, DasGupta B and Lin J Pricing of parking for congestion reduction Proceedings of the 20th International Conference on Advances in Geographic Information Systems, (43-51)
- Srivatsa M and Hicks M Deanonymizing mobility traces Proceedings of the 2012 ACM conference on Computer and communications security, (628-637)
- Goemans M, Iwata S and Zenklusen R (2012). A flow model based on polylinking system, Mathematical Programming: Series A and B, 135:1-2, (1-23), Online publication date: 1-Oct-2012.
- Amini O, Peleg D, Pérennes S, Sau I and Saurabh S (2012). On the approximability of some degree-constrained subgraph problems, Discrete Applied Mathematics, 160:12, (1661-1679), Online publication date: 1-Aug-2012.
- Aziz H, Harrenstein P, Brill M, Lang J, Fischer F and Seedig H Possible and necessary winners of partial tournaments Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (585-592)
- Kino F and Uno Y Solving tantrix via integer programming Proceedings of the 6th international conference on Fun with Algorithms, (245-257)
- Chicoisne R, Espinoza D, Goycoolea M, Moreno E and Rubio E (2012). A New Algorithm for the Open-Pit Mine Production Scheduling Problem, Operations Research, 60:3, (517-528), Online publication date: 1-May-2012.
- Galli L, Kaparis K and Letchford A Gap inequalities for the max-cut problem Proceedings of the Second international conference on Combinatorial Optimization, (178-188)
- Hegazy T, Elhakeem A, Singh Ahluwalia S and Attalla M (2012). MOST-FIT, Computer-Aided Civil and Infrastructure Engineering, 27:2, (130-142), Online publication date: 1-Feb-2012.
- Faenza Y, Oriolo G and Stauffer G Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (1298-1308)
- Zaourar L, Kieffer Y and Aktouf C (2012). A graph-based approach to optimal scan chain stitching using RTL design descriptions, VLSI Design, 2012, (3-3), Online publication date: 1-Jan-2012.
- Ayala D, Wolfson O, Xu B, Dasgupta B and Lin J Parking slot assignment games Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (299-308)
- Gørtz I, Molinaro M, Nagarajan V and Ravi R Capacitated vehicle routing with non-uniform speeds Proceedings of the 15th international conference on Integer programming and combinatoral optimization, (235-247)
- Bansal N, Lee K, Nagarajan V and Zafer M Minimum congestion mapping in a cloud Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (267-276)
- Yang D, Fang X and Xue G Truthful auction for cooperative communications Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing, (1-10)
- Mcconnell R, Mehlhorn K, Näher S and Schweitzer P (2011). Survey, Computer Science Review, 5:2, (119-161), Online publication date: 1-May-2011.
- Halldórsson M, Kortsarz G and Sviridenko M (2011). Sum edge coloring of multigraphs via configuration LP, ACM Transactions on Algorithms, 7:2, (1-21), Online publication date: 1-Mar-2011.
- Dey S and Vielma J The chvátal-gomory closure of an ellipsoid is a polyhedron Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization, (327-340)
- Gao P and Wormald N Load balancing and orientability thresholds for random hypergraphs Proceedings of the forty-second ACM symposium on Theory of computing, (97-104)
- Lando Y and Nutov Z (2010). On minimum power connectivity problems, Journal of Discrete Algorithms, 8:2, (164-173), Online publication date: 1-Jun-2010.
- Tuyttens D and Vandaele A (2010). Using a greedy random adaptative search procedure to solve the cover printing problem, Computers and Operations Research, 37:4, (640-648), Online publication date: 1-Apr-2010.
- Anthony B, Goyal V, Gupta A and Nagarajan V (2010). A Plant Location Guide for the Unsure, Mathematics of Operations Research, 35:1, (79-101), Online publication date: 1-Feb-2010.
- Kamiyama N Construction of candidate topologies for large-scale networks Proceedings of the 28th IEEE conference on Global telecommunications, (940-945)
- Rothvoß T and Sanità L On the Complexity of the Asymmetric VPN Problem Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, (326-338)
- Chen Y A Fast Approximation Algorithm for the k Partition-Distance Problem Proceedings of the International Conference on Computational Science and Its Applications: Part II, (537-546)
- Kortsarz G and Nutov Z (2009). Approximating minimum-power edge-covers and 2,3-connectivity, Discrete Applied Mathematics, 157:8, (1840-1847), Online publication date: 1-Apr-2009.
- Erera A, Morales J and Savelsbergh M (2009). Robust Optimization for Empty Repositioning Problems, Operations Research, 57:2, (468-483), Online publication date: 1-Mar-2009.
- de Werra D, Demange M, Escoffier B, Monnot J and Paschos V (2009). Weighted coloring on planar, bipartite and split graphs, Discrete Applied Mathematics, 157:4, (819-832), Online publication date: 20-Feb-2009.
- Goseling J, Fragouli C and Diggavi S (2009). Network coding for undirected information exchange, IEEE Communications Letters, 13:1, (25-27), Online publication date: 1-Jan-2009.
- Kim E and Kececioglu J (2008). Learning Scoring Schemes for Sequence Alignment from Partial Examples, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5:4, (546-556), Online publication date: 1-Oct-2008.
- Chan J, Bailey J and Leckie C (2008). Discovering correlated spatio-temporal changes in evolving graphs, Knowledge and Information Systems, 16:1, (53-96), Online publication date: 1-Jul-2008.
- Parekh O (2008). Approximation algorithms for partially covering with edges, Theoretical Computer Science, 400:1-3, (159-168), Online publication date: 20-Jun-2008.
- Halldórsson M, Kortsarz G and Sviridenko M Min sum edge coloring in multigraphs via configuration LP Proceedings of the 13th international conference on Integer programming and combinatorial optimization, (359-373)
- Kortsarz G, Mirrokni V, Nutov Z and Tsanko E Approximating minimum-power degree and connectivity problems Proceedings of the 8th Latin American conference on Theoretical informatics, (423-435)
- Cocking C (2008). Finding an optimal tooth color match, XRDS: Crossroads, The ACM Magazine for Students, 14:3, (22-25), Online publication date: 1-Mar-2008.
- Harvey N Matroid intersection, pointer chasing, and Young's seminormal representation of S Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (542-549)
- Mestre J Adaptive local ratio Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (152-160)
- Lando Y and Nutov Z On minimum power connectivity problems Proceedings of the 15th annual European conference on Algorithms, (87-98)
- Tavazoei M and Haeri M (2007). An optimization algorithm based on chaotic behavior and fractal nature, Journal of Computational and Applied Mathematics, 206:2, (1070-1081), Online publication date: 20-Sep-2007.
- Kim E and Kececioglu J Inverse sequence alignment from partial examples Proceedings of the 7th international conference on Algorithms in Bioinformatics, (359-370)
- Chen W and Meng J Approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders Proceedings of the 1st international conference on Combinatorial optimization and applications, (163-170)
- Hartvigsen D and Li Y Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization, (43-52)
- Park H and Lee J (2007). B-spline curve fitting based on adaptive curve refinement using dominant points, Computer-Aided Design, 39:6, (439-451), Online publication date: 1-Jun-2007.
- Porschen S and Speckenmeyer E Algorithms for variable-weighted 2-SAT and dual problems Proceedings of the 10th international conference on Theory and applications of satisfiability testing, (173-186)
- Wu J and Durfee E Sequential resource allocation in multiagent systems with uncertainties Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-8)
- Ribeiro C, Martins S and Rosseti I (2007). Metaheuristics for optimization problems in computer communications, Computer Communications, 30:4, (656-669), Online publication date: 15-Feb-2007.
- Carmo R, Feder T, Kohayakawa Y, Laber E, Motwani R, O'Callaghan L, Panigrahy R and Thomas D (2007). Querying priced information in databases, ACM Transactions on Algorithms, 3:1, (1-22), Online publication date: 1-Feb-2007.
- Rote G and Zachariasen M Matrix scaling by network flow Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (848-854)
- Briest P and Krysta P Buying cheap is expensive Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (716-725)
- Harvey N An algebraic algorithm for weighted linear matroid intersection Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (444-453)
- Asahiro Y, Horiyama T, Makino K, Ono H, Sakuma T and Yamashita M (2006). How to collect balls moving in the Euclidean plane, Discrete Applied Mathematics, 154:16, (2247-2262), Online publication date: 1-Nov-2006.
- Alia M, Horn G, Eliassen F, Khan M, Fricke R and Reichle R A component-based planning framework for adaptive systems Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II, (1686-1704)
- Kingsford C, Zaslavsky E and Singh M A compact mathematical programming formulation for DNA motif finding Proceedings of the 17th Annual conference on Combinatorial Pattern Matching, (233-245)
- Ural H and Zhang F Reducing the lengths of checking sequences by overlapping Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems, (274-288)
- Wu J and Durfee E Mixed-integer linear programming for transition-independent decentralized MDPs Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (1058-1060)
- Wu J and Durfee E Mathematical programming for deliberation scheduling in time-limited domains Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (874-881)
- Subramani K and Desovski D (2006). On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection, Applied Mathematics and Computation, 173:1, (273-305), Online publication date: 1-Feb-2006.
- Gandhi R, Halldórsson M, Kortsarz G and Shachnai H (2006). Improved results for data migration and open shop scheduling, ACM Transactions on Algorithms, 2:1, (116-129), Online publication date: 1-Jan-2006.
- Benkoczi R, Hassanein H, Akl S and Tai S QoS for data relaying in hierarchical wireless sensor networks Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks, (47-54)
- Wu J and Durfee E Automated resource-driven mission phasing techniques for constrained agents Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (331-338)
- Chiang C, Kahng A, Sinha S and Xu X Fast and efficient phase conflict detection and correction in standard-cell layouts Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (149-156)
- Kwon S, Kim H and Kang M (2005). Determination of the candidate arc set for the asymmetric traveling salesman problem, Computers and Operations Research, 32:5, (1045-1057), Online publication date: 1-May-2005.
- Egidi N and Maponi P (2005). A class of network optimization methods for planar grid generation, Applied Numerical Mathematics, 52:4, (363-379), Online publication date: 1-Mar-2005.
- Bazgan C, Hassin R and Monnot J (2005). Approximation algorithms for some vehicle routing problems, Discrete Applied Mathematics, 146:1, (27-42), Online publication date: 15-Feb-2005.
- Calinescu G Bounding the Payment of Approximate Truthful Mechanisms Algorithms and Computation, (221-233)
- Boykov Y and Kolmogorov V (2004). An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:9, (1124-1137), Online publication date: 1-Sep-2004.
- Goldengorin B, Sierksma G and Turkensteen M Tolerance based algorithms for the ATSP Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science, (222-234)
- Li W, Reddy S and Pomeranz I On test generation for transition faults with minimized peak power dissipation Proceedings of the 41st annual Design Automation Conference, (504-509)
- Fekete S, Lübbecke M and Meijer H Minimizing the stabbing number of matchings, trees, and triangulations Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (437-446)
- Lancia G (2004). Integer programming models for computational biology problems, Journal of Computer Science and Technology, 19:1, (60-77), Online publication date: 1-Jan-2004.
- Caprara A, Monaci M and Toth P (2003). Models and algorithms for a staff scheduling problem, Mathematical Programming: Series A and B, 98:1-3, (445-476), Online publication date: 1-Sep-2003.
- Korach E and Stern M (2003). The clustering matroid and the optimal clustering tree, Mathematical Programming: Series A and B, 98:1-3, (385-414), Online publication date: 1-Sep-2003.
- Hartvigsen D (2003). Characterizing the flow equivalent trees of a network, Discrete Applied Mathematics, 128:2-3, (387-394), Online publication date: 1-Jun-2003.
- Bazgan C, Hassin R and Monnot J Differential approximation for some routing problems Proceedings of the 5th Italian conference on Algorithms and complexity, (277-288)
- Firla R, Spille B and Weismantel R Algorithmic characterization of bipartite b-matching and matroid intersection Combinatorial optimization - Eureka, you shrink!, (48-63)
- Mehlhorn K The reliable algorithmic software challenge RASC Computer Science in Perspective, (255-263)
- Marchand H, Martin A, Weismantel R and Wolsey L (2002). Cutting planes in integer and mixed integer programming, Discrete Applied Mathematics, 123:1-3, (397-446), Online publication date: 15-Nov-2002.
- Bagchi A, Chaudhary A, Scheideler C and Kolman P Algorithms for fault-tolerant routing in circuit switched networks Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (265-274)
- Cunningham W (2002). Matching, matroids, and extensions, Mathematical Programming: Series A and B, 91:3, (515-542), Online publication date: 1-Feb-2002.
- Parekh O Edge dominating and hypomatchable sets Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (287-291)
- Janssen J Channel assignment and graph labeling Handbook of wireless networks and mobile computing, (95-117)
- Maponi P and Zirilli F (2001). A Class of Global Optimization Problems as Models of the Phase Unwrapping Problem, Journal of Global Optimization, 21:3, (289-316), Online publication date: 1-Nov-2001.
- Choi K and Chatterjee A Efficient instruction-level optimization methodology for low-power embedded systems Proceedings of the 14th international symposium on Systems synthesis, (147-152)
- Jayram T, Kimbrel T, Krauthgamer R, Schieber B and Sviridenko M Online server allocation in a server farm via benefit task systems Proceedings of the thirty-third annual ACM symposium on Theory of computing, (540-549)
- Udayanarayanan S and Chakrabarti C Address code generation for digital signal processors Proceedings of the 38th annual Design Automation Conference, (353-358)
- Bockmayr A and Eisenbrand F (2001). Cutting Planes and the Elementary Closure in Fixed Dimension, Mathematics of Operations Research, 26:2, (304-312), Online publication date: 1-May-2001.
- Lancia G, Carr R, Walenz B and Istrail S 101 optimal PDB structure alignments Proceedings of the fifth annual international conference on Computational biology, (193-202)
- Kahng A, Vaya S and Zelikovsky A New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout Proceedings of the 2001 Asia and South Pacific Design Automation Conference, (133-138)
- Althaus E and Mehlhorn K TSP-based curve reconstruction in polynomial time Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (686-695)
- Muhammad K and Roy K A Graph Theoretic Approach for Design and Synthesis of Multiplierless FIR Filters Proceedings of the 12th international symposium on System synthesis
- Berman P, Kahng A, Vidhani D, Wang H and Zelikovsky A Optimal phase conflict removal for layout of dark field alternating phase shifting masks Proceedings of the 1999 international symposium on Physical design, (121-126)
- Wayne K A new property and a faster algorithm for baseball elimination Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (815-819)
Index Terms
- Combinatorial optimization
Recommendations
Combining multi-core and GPU computing for solving combinatorial optimization problems
In this paper, we revisit the design and implementation of Branch-and-Bound (B&B) algorithms for solving large combinatorial optimization problems on GPU-enhanced multi-core machines. B&B is a tree-based optimization method that uses four operators (...
On the combinatorial alphabets of a language
The combinatorial degree (or dimension) of a language L over a finite alphabet Σ is the positive integer d(L) = min{card(A) | A ⊂ Σ*, L ⊂ A*}. A subset A of Σ* for which L ⊂ A* and card (A) = d(L) will be called a combinatorial alphabet of the language ...
Exploration of automatic optimisation for CUDA programming
Writing optimised compute unified device architecture CUDA program for graphic processing units GPUs is complex even for experts. We present a design methodology for a restructuring tool that converts C-loops into optimised CUDA kernels based on a three-...