ISSN: 1572-5286

Journal Home

Journal Guideline

Discrete Optimization Q3 Unclaimed

Elsevier B.V. Netherlands

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Discrete Optimization is a journal indexed in SJR in Applied Mathematics and Computational Theory and Mathematics with an H index of 42. It has an SJR impact factor of 0,443 and it has a best quartile of Q3. It is published in English. It has an SJR impact factor of 0,443.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q3) Computational Theory and Mathematics (Q3) Theoretical Computer Science (Q3)

Price

- €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,443

SJR Impact factor

42

H Index

28

Total Docs (Last Year)

83

Total Docs (3 years)

816

Total Refs

94

Total Cites (3 years)

81

Citable Docs (3 years)

1.13

Cites/Doc (2 years)

29.14

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Journal of Dynamics and Games Q3
Journal of Discrete Mathematical Sciences and Cryptography Q3
East Asian Journal on Applied Mathematics Q3
Functional Analysis and its Applications Q3
Measurement and Control Q3

Compare this journals

Aims and Scope

Best articles by citations

Conflict analysis in mixed integer programming

Feasibility recovery for the Unit-capacity Constrained Permutation Problem

Strong polynomiality of resource constraint propagation

The envy-free pricing problem, unit-demand markets and connections with the network pricing problem

Improved bounds for vehicle routing solutions

Online bin packing with resource augmentation

Advances on defective parameters in graphs

Generating partitions of a graph into a fixed number of minimum weight cuts

Two-dimensional bin packing with one-dimensional resource augmentation

Tree decompositions of graphs: Saving memory in dynamic programming

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Multi-commodity variable upper bound flow models

SHOW MORE ARTICLES

Polyhedral results for a class of cardinality constrained submodular minimization problems

Polyhedral results on single node variable upper-bound flow models with allowed configurations

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques

Biclique completion problems for multicast network design

A linear time algorithm for balance vertices on trees

A strongly polynomial algorithm for line search in submodular polyhedra

L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem

How tight is the corner relaxation?

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Note on pseudolattices, lattices and submodular linear programs

Computing integral solutions of complementarity problems

A Special Issue in Memory of George B. Dantzig