skip to main content
Idioma:
Resultados 1 2 3 4 5 next page
Refinado por: Base de dados/Biblioteca: Journals@Ovid Ovid Full Text remover assunto: Mathematics, Applied remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
The unconstrained binary quadratic programming problem: a survey
The unconstrained binary quadratic programming problem: a survey
Material Type:
Artigo 		Adicionar ao Meu Espaço

The unconstrained binary quadratic programming problem: a survey

Kochenberger, Gary ; Hao, Jin-Kao ; Glover, Fred ; Lewis, Mark ; Lü, Zhipeng ; Wang, Haibo ; Wang, Yang

Journal of combinatorial optimization, 2014-07, Vol.28 (1), p.58-81 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

Citações Citado por
2
Self-orthogonal codes over a non-unital ring and combinatorial matrices
Self-orthogonal codes over a non-unital ring and combinatorial matrices
Material Type:
Artigo 		Adicionar ao Meu Espaço

Self-orthogonal codes over a non-unital ring and combinatorial matrices

Shi, Minjia ; Wang, Shukai ; Kim, Jon-Lark ; Solé, Patrick

Designs, codes, and cryptography, 2023-02, Vol.91 (2), p.677-689 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
3
Operating room planning and surgical case scheduling: a review of literature
Operating room planning and surgical case scheduling: a review of literature
Material Type:
Artigo 		Adicionar ao Meu Espaço

Operating room planning and surgical case scheduling: a review of literature

Zhu, Shuwan ; Fan, Wenjuan ; Yang, Shanlin ; Pei, Jun ; Pardalos, Panos M.

Journal of combinatorial optimization, 2019-04, Vol.37 (3), p.757-805 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
4
Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost
Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost
Material Type:
Artigo 		Adicionar ao Meu Espaço

Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost

Lu, Lingfa ; Zhang, Liqi

Journal of combinatorial optimization, 2023-08, Vol.46 (1), Article 9 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
5
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

Bonamy, Marthe ; Johnson, Matthew ; Lignos, Ioannis ; Patel, Viresh ; Paulusma, Daniël

Journal of combinatorial optimization, 2014-01, Vol.27 (1), p.132-143 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

Citações Citado por
6
Approximation algorithms for the maximally balanced connected graph tripartition problem
Approximation algorithms for the maximally balanced connected graph tripartition problem
Material Type:
Artigo 		Adicionar ao Meu Espaço

Approximation algorithms for the maximally balanced connected graph tripartition problem

Chen, Guangting ; Chen, Yong ; Chen, Zhi-Zhong ; Lin, Guohui ; Liu, Tian ; Zhang, An

Journal of combinatorial optimization, 2022-10, Vol.44 (3), p.1753-1773 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
7
On sets of subspaces with two intersection dimensions and a geometrical junta bound
On sets of subspaces with two intersection dimensions and a geometrical junta bound
Material Type:
Artigo 		Adicionar ao Meu Espaço

On sets of subspaces with two intersection dimensions and a geometrical junta bound

Longobardi, Giovanni ; Storme, Leo ; Trombetti, Rocco

Designs, codes, and cryptography, 2022-09, Vol.90 (9), p.2081-2099 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
8
Incremental optimization of independent sets under the reconfiguration framework
Incremental optimization of independent sets under the reconfiguration framework
Material Type:
Artigo 		Adicionar ao Meu Espaço

Incremental optimization of independent sets under the reconfiguration framework

Ito, Takehiro ; Mizuta, Haruka ; Nishimura, Naomi ; Suzuki, Akira

Journal of combinatorial optimization, 2022-07, Vol.43 (5), p.1264-1279 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
9
On the enumeration of minimal non-pairwise compatibility graphs
On the enumeration of minimal non-pairwise compatibility graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the enumeration of minimal non-pairwise compatibility graphs

Azam, Naveed Ahmed ; Shurbevski, Aleksandar ; Nagamochi, Hiroshi

Journal of combinatorial optimization, 2022-11, Vol.44 (4), p.2871-2892 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
10
The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO
The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO
Material Type:
Artigo 		Adicionar ao Meu Espaço

The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO

Gao, Linqing ; Ha, Dengzhe ; Ma, Litao ; Chen, Jiqiang

Journal of combinatorial optimization, 2024-03, Vol.47 (2), Article 5 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

Citações Citado por
Resultados 1 2 3 4 5 next page

Personalize Seus Resultados

  1. Editar

Refine Search Results

Expandir Meus Resultados

  1.   

Data de Publicação 

De até
Refinar
  1. Antes de2001  (11)
  2. 2001Até2005  (27)
  3. 2006Até2010  (191)
  4. 2011Até2016  (740)
  5. Após 2016  (1.142)
  6. Mais opções open sub menu

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.