Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published April 1, 2019 | Version v1.0
Software Open

tnas/knapsack-problem: knapsack-problem-canonicalAG

Authors/Creators

  • Thiago Nascimento

Description

  • An elitist repair strategy
  • A simple static penalty function

Files

tnas/knapsack-problem-v1.0.zip

Files (1.3 MB)

Name Size Download all
tnas/knapsack-problem-v1.0.zip
md5:181f009f32e9717a1e6ba8523a19665e
1.3 MB Preview Download

Additional details

Related works

Is supplement to
https://github.com/tnas/knapsack-problem/tree/v1.0 (URL)
32
Views
14
Downloads
Show more details
All versions This version
Views

Total views

32 31
Downloads

Total downloads

14 14
Data volume

Total data volume

19.1 MB 19.1 MB

More info on how stats are collected....

Versions

External resources

Available in
  • tnas/knapsack-problem

    Release: v1.0

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.2620503
DOI Badge

DOI

10.5281/zenodo.2620503

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.2620503.svg)](https://doi.org/10.5281/zenodo.2620503)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.2620503.svg
  :target: https://doi.org/10.5281/zenodo.2620503

HTML

<a href="https://doi.org/10.5281/zenodo.2620503"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.2620503.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.2620503.svg

Target URL

https://doi.org/10.5281/zenodo.2620503
Resource type
Software
Publisher
Zenodo

Rights

License
Other (Open)
No further description.

Citation

Export

Technical metadata

Created
April 1, 2019
Modified
January 24, 2020

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Help

  • Overview
  • FAQ
  • Support

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use
  • Support

This site uses cookies. Find out more on how we use cookies