Log in

Relevant bibliographies by topics / Combinatorics and Optimization

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Combinatorics and Optimization'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatorics and Optimization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Combinatorics and Optimization"

1

Gerards, A. M. H., and A. W. J. Kolen. "Polyhedral Combinatorics in Combinatorial Optimization." Statistica Neerlandica 41, no. 1 (1987): 1–25. http://dx.doi.org/10.1111/j.1467-9574.1987.tb01168.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mardiningsih, Saib Suwilo, and Ihda Hasbiyati. "Existence of Polynomial Combinatorics Graph Solution." Journal of Research in Mathematics Trends and Technology 2, no. 1 (2020): 7–13. http://dx.doi.org/10.32734/jormtt.v2i1.3755.

Full text

Abstract:

The Polynomial Combinatorics comes from optimization problem combinatorial in form the nonlinear and integer programming. This paper present a condition such that the polynomial combinatorics has solution. Existence of optimum value will be found by restriction of decision variable and properties of feasible solution set or polyhedra.

APA, Harvard, Vancouver, ISO, and other styles

3

Biggs, N. L. "GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2)." Bulletin of the London Mathematical Society 22, no. 2 (1990): 204–5. http://dx.doi.org/10.1112/blms/22.2.204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

DE FARIAS, I. R., E. L. JOHNSON, and G. L. NEMHAUSER. "Branch-and-cut for combinatorial optimization problems without auxiliary binary variables." Knowledge Engineering Review 16, no. 1 (2001): 25–39. http://dx.doi.org/10.1017/s0269888901000030.

Full text

Abstract:

Many optimisation problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems have been modeled as mixed-integer programs by introducing auxiliary binary variables and additional constraints. Because the number of variables and constraints becomes larger and the combinatorial structure is not used to advantage, these mixed-integer programming models may not be solved satisfactorily, except for

APA, Harvard, Vancouver, ISO, and other styles

5

Szu, Harold, Yoshiyasu Takefuji, and Simon Y. Foo. "Presenting the special issue on optimization and combinatorics." Neurocomputing 8, no. 1 (1995): 3–4. http://dx.doi.org/10.1016/0925-2312(95)00006-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Onn, Shmuel, and Uriel G. Rothblum. "Convex Combinatorial Optimization." Discrete & Computational Geometry 32, no. 4 (2004): 549–66. http://dx.doi.org/10.1007/s00454-004-1138-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Roland, Julien, Yves De Smet, and José Rui Figueira. "Inverse multi-objective combinatorial optimization." Discrete Applied Mathematics 161, no. 16-17 (2013): 2764–71. http://dx.doi.org/10.1016/j.dam.2013.04.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Bo, Silvano Martello, and Bernard Ries. "New progress in combinatorial optimization." Discrete Applied Mathematics 290 (February 2021): 68–70. http://dx.doi.org/10.1016/j.dam.2020.12.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chen, Bo, Silvano Martello, and Bernard Ries. "New progress in combinatorial optimization." Discrete Applied Mathematics 290 (February 2021): 68–70. http://dx.doi.org/10.1016/j.dam.2020.12.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Grebennik, I. V., and O. S. Chorna. "CYCLIC PERMUTATIONS IN THE METHODS OF COMBINATORIAL OPTIMIZATION ON THE BASIS OF CYCLIC TRANSFERS." Bionics of Intelligence 2, no. 93 (2019): 28–33. http://dx.doi.org/10.30837/bi.2019.2(93).05.

Full text

Abstract:

Permutations sets are very often considered in theoretical and applied research in the field of combinatorics andcombinatorial optimization. By now many properties of permutations have been investigated, in particular those associatedwith the cyclic structure of permutations. To solve optimization problems on combinatorial sets, a number of methodshave been developed and successfully used. Among them, there are methods for finding exact, approximate, and heuristicsolutions. Among the search methods for an approximate solution, search methods in the neighborhood are widely used.Among the combin

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Combinatorics and Optimization"

1

Samieinia, Shiva. "Digital Geometry, Combinatorics, and Discrete Optimization." Doctoral thesis, Stockholms universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-47399.

Full text

Abstract:

This thesis consists of two parts: digital geometry and discrete optimization. In the first part we study the structure of digital straight line segments. We also study digital curves from a combinatorial point of view. In Paper I we study the straightness in the 8-connected plane and in the Khalimsky plane by considering vertical distances and unions of two segments. We show that we can investigate the straightness of Khalimsky arcs by using our knowledge from the 8-connected plane. In Paper II we determine the number of Khalimsky-continuous functions with 2, 3 and 4 points in their codomain.

APA, Harvard, Vancouver, ISO, and other styles

2

Leung, Pak-kin Richard, and 梁柏堅. "Bottleneck problems in combinatorics and optimization." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B42128638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Leung, Pak-kin Richard. "Bottleneck problems in combinatorics and optimization." Click to view the E-thesis via HKUTO, 1998. http://sunzi.lib.hku.hk/hkuto/record/B42128638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Curtis, Sharon. "A relational approach to optimization problems." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318803.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mahar, Mumtaz Hussain. "Network optimization and its applications to discrete programming problems." Thesis, Brunel University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294509.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Poirion, Pierre-Louis. "Programmation linéaire mixte robuste; Application au dimensionnement d'un système hybride de production d'électricité." Thesis, Paris, CNAM, 2013. http://www.theses.fr/2015CNAM0948/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à l’optimisation robuste. Plus précisément,nous nous intéresserons aux problèmes linéaires mixtes bi-niveaux, c’est à dire aux problèmes dans lesquels le processus de décision est divisé en deux parties : dans un premier temps, les valeurs optimales des variables dites "de décisions" seront calculées ; puis, une fois que l’incertitude sur les données est levée, nous calculerons les valeurs des variables dites "de recours". Dans cette thèse, nousnous limiterons au cas où les variables de deuxième étape, dites "de recours", sontcontinues.Dans la première p

APA, Harvard, Vancouver, ISO, and other styles

7

Riener, Cordian [Verfasser], Thorsten [Akademischer Betreuer] Theobald, Markus [Akademischer Betreuer] Schweighofer, and Christine [Akademischer Betreuer] Bachoc. "Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle / Cordian Benedikt Riener. Gutachter: Thorsten Theobald ; Markus Schweighofer ; Christine Bachoc." Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2011. http://d-nb.info/1044194839/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Huynh, Tony. "The Linkage Problem for Group-labelled Graphs." Thesis, University of Waterloo, University of Waterloo, 2009. http://hdl.handle.net/10012/4716.

Full text

Abstract:

This thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled from $\Gamma$, and is thus a generalization of a signed graph. Our primary result is a generalization of the main result from Graph Minors XIII. For any finite abelian group $\Gamma$, and any fixed $\Gamma$-labelled graph $H$, we present a polynomial-time algorithm that determines if an input $\Gamma$-labelled graph $G$ has an $H$-minor. The correctness of our algorit

APA, Harvard, Vancouver, ISO, and other styles

9

Porto, Claudia Akemi Furushima. "Algoritmos para resolução do problema de empacotamento de conjuntos utilizando poliedros quase inteiros." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275774.

Full text

Abstract:

Orientador: Cid Carvalho de Souza<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-17T07:58:08Z (GMT). No. of bitstreams: 1 Porto_ClaudiaAkemiFurushima_M.pdf: 1805902 bytes, checksum: 15341772d15a37d8642fa403d27fbd6a (MD5) Previous issue date: 2010<br>Resumo: O resumo poderá ser visualizado no texto completo da tese digital<br>Abstract: The abstract is available with the full electronic digital document<br>Mestrado<br>Teoria da Computação<br>Mestre em Ciência da Computação

APA, Harvard, Vancouver, ISO, and other styles

10

de, Carli Silva Marcel Kenji. "Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality." Thesis, 2013. http://hdl.handle.net/10012/7812.

Full text

Abstract:

The Lovasz theta function and the associated convex sets known as theta bodies are fundamental objects in combinatorial and semidefinite optimization. They are accompanied by a rich duality theory and deep connections to the geometric concept of orthonormal representations of graphs. In this thesis, we investigate several ramifications of the theory underlying these objects, including those arising from the illuminating viewpoint of duality. We study some optimization problems over unit-distance representations of graphs, which are intimately related to the Lovasz theta function and orthonorma

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Combinatorics and Optimization"

1

Pardalos, P. M. Handbook of combinatorial optimization. Springer, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Enumerative combinatorics. Cambridge University Press, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stanley, Richard P. Enumerative combinatorics. Wadsworth & Brooks/Cole Advanced Books & Software, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

1952-, He Tian-Xiao, Shiue Peter Jau-Shyong 1941-, Li Zhongkai Professor, Hsu L. C. 1920-, Dalian li gong da xue., and Guo jia zi ran ke xue ji jin wei yuan hui (China), eds. Analysis, combinatorics, and computing. Nova Science Publishers, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Padberg, Manfred. Linear Optimization and Extensions. Springer Berlin Heidelberg, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Polyhedral combinatorics and the acyclic subdigraph problem. Heldermann, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mathematical problems and proofs: Combinatorics, number theory, and geometry. Plenum Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry. Kluwer Academic Publishers, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Habib, Youssef, ed. Iterative computer algorithms with applications in engineering: Solving combinatorial optimization problems. IEEE Computer Society, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Melnikov, O. Exercises in Graph Theory. Springer Netherlands, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Combinatorics and Optimization"

1

Barbosa, Valmir C. "The Combinatorics of Resource Sharing." In Applied Optimization. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3609-0_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Korte, Bernhard, Rainer Schrader, and László Lovász. "Optimization in Greedoids." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58191-5_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Grötschel, Martin, László Lovász, and Alexander Schrijver. "Combinatorial Optimization: Some Basic Examples." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-97881-4_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Grötschel, Martin, László Lovász, and Alexander Schrijver. "Combinatorial Optimization: A Tour d’Horizon." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-97881-4_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Grötschel, Martin, László Lovász, and Alexander Schrijver. "Combinatorial Optimization: Some Basic Examples." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-78240-4_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Grötschel, Martin, László Lovász, and Alexander Schrijver. "Combinatorial Optimization: A Tour d’Horizon." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-78240-4_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Abeledo, Hernán, and Gary Atkinson. "Polyhedral Combinatorics of Benzenoid Problems." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69346-7_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lovász, L. "Semidefinite Programs and Combinatorial Optimization." In Recent Advances in Algorithms and Combinatorics. Springer New York, 2003. http://dx.doi.org/10.1007/0-387-22444-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Euler, Reinhardt, and Laurent Lemarchand. "Some applications of combinatorial optimization in parallel computing." In Combinatorics and Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61576-8_95.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Steger, A. "Approximability of NP-Optimization Problems." In Recent Advances in Algorithms and Combinatorics. Springer New York, 2003. http://dx.doi.org/10.1007/0-387-22444-0_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combinatorics and Optimization"

1

Danoy, Gregoire, Didier El Baz, Vincent Boyer, Bernabe Dorronsoro, Laurence T. Yang, and Keqin Li. "Workshop 9: PDCO Parallel / Distributed Combinatorics and Optimization." In 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2020. http://dx.doi.org/10.1109/ipdpsw50202.2020.00089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Buhmann, Joachim M., Julien Dumazert, Alexey Gronskiy, and Wojciech Szpankowski. "Phase Transitions in Parameter Rich Optimization Problems." In 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974775.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Oleg, Riznyk, Kynash Yurii, Povshuk Oleksandr, and Balych Bohdan. "Information technologies of optimization of structures of the systems are on the basis of combinatorics methods." In 2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT). IEEE, 2017. http://dx.doi.org/10.1109/stc-csit.2017.8098776.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kumar, Rajeev. "Evolutionary multiobjective combinatorial optimization." In the 2007 GECCO conference companion. ACM Press, 2007. http://dx.doi.org/10.1145/1274000.1274117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Knezevic, Karlo. "Combinatorial Optimization in Cryptography." In 2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE, 2017. http://dx.doi.org/10.23919/mipro.2017.7973628.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gupta, Anupam, Katrina Ligett, Frank McSherry, Aaron Roth, and Kunal Talwar. "Differentially Private Combinatorial Optimization." In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611973075.90.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kumar, Rajeev. "Evolutionary multiobjective combinatorial optimization (EMCO)." In the 2008 GECCO conference companion. ACM Press, 2008. http://dx.doi.org/10.1145/1388969.1389079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Saharan, Sahil, J. S. Lather, and R. Radhakrishnan. "Combinatorial problem optimization using TLBO." In 2017 4th International Conference on Signal Processing, Computing and Control (ISPCC). IEEE, 2017. http://dx.doi.org/10.1109/ispcc.2017.8269741.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kumar, Rajeev. "Evolutionary multiobjective combinatorial optimization (EMCO)." In the 11th annual conference companion. ACM Press, 2009. http://dx.doi.org/10.1145/1570256.1570425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Neumann, Frank, and Carsten Witt. "Bioinspired computation in combinatorial optimization." In the fourteenth international conference. ACM Press, 2012. http://dx.doi.org/10.1145/2330784.2330928.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Combinatorics and Optimization"

1

Bixby, Robert E. Notes on Combinatorial Optimization. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada455247.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Coffrin, Carleton James. Combinatorial Optimization on D-Wave. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1454977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

GEORGE MASON UNIV FAIRFAX VA. Solving Large-Scale Combinatorial Optimization Problems. Defense Technical Information Center, 1996. http://dx.doi.org/10.21236/ada327597.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Radzik, Thomas. Newton's Method for Fractional Combinatorial Optimization,. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada323687.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hoffman, Karla L. Solution Procedures for Large-Scale Combinatorial Optimization. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada278242.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Plotkin, Serge. Research in Graph Algorithms and Combinatorial Optimization. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada292630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Parekh, Ojas, Robert D. Carr, and David Pritchard. LDRD final report : combinatorial optimization with demands. Office of Scientific and Technical Information (OSTI), 2012. http://dx.doi.org/10.2172/1055603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Shepherd, Bruce, Peter Winkler, and Chandra Chekuri. Fundamentals of Combinatorial Optimization and Algorithm Design. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada423042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wets, Roger D. Parametric and Combinatorial Problems in Constrained Optimization. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada264229.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jaillet, Patrick. Data-Driven Online and Real-Time Combinatorial Optimization. Defense Technical Information Center, 2013. http://dx.doi.org/10.21236/ada592939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!