OpenAlex
PricingAboutJobs
Log inGet started
Work

The mathematical background of proving processes in discrete optimization—exemplification with Research Situations for the Classroom

HTML PDF

Year: 2022
Type: article
Source: ZDM
DOI: 10.1007/s11858-022-01400-3
Authors: Sylvain Gravier, Cécile Ouvrier-Buffet
Institutions: Centre National de la Recherche Scientifique, Institut Fourier, Université Paris-Est Créteil, Laboratoire de Didactique André Revuz, Université Paris Diderot
Language: English

Topic: Mathematics Education and Teaching Techniques
Subfield: Education
Field: Social Sciences
Domain: Social Sciences
Keywords: discrete optimization, mathematical proof, proof process, didactic situations, eight queens problem, epistemological obstacles, necessary and sufficient conditions, partitioning strategies, greedy algorithm, primal-dual algorithm, duality, polyominoes, mathematics education
SDG: Quality education

Open Access status: green
OpenAlex ID: W4285387474
FWCI: 4.361
Cites: 54
Cited by: 20
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security